Abstract This paper presents the construction of RLL-ECCs (run length limited error control codes) from three selected ECCs specified by Consultative Committee for Space Data Systems (CCSDS) optical communications. The obtained present a practical alternative to CCSDS codes with pseudo-randomizers. Their advantage is that maximal run lengths equal symbols in their codeword sequences are guarant...

Given a sequence of letters generated independently from a finite alphabet, we consider the case when more than one, but not all, letters are generated with the highest probability. The length of the longest run of any of these letters is shown to be one greater than the length of the longest run in a particular state of an associated Markov chain. Using results of Foulser and Karlin (19...

To keep an eye on the status of high-quality processes for fraction nonconforming, synthetic double sampling (SDS) np chart is a helpful tool. The SDS hybrid between (DS) and conforming run length (CRL) chart. performance control typically judged solely using average (ARL). However, as shape (RL) distribution varies with magnitude shift in process ARL no longer provides clear interpretation cha...

Introduction: The aim of this study was to compare digital and conventional radiography in determining the working length of dilacerated canals.Methods: Thirty nine human extracted single-rooted teeth with root curvature more than 35 degrees were included in this study. After access preparation, a file was inserted into the canal and advanced until the file tip was visualized at the foramen. Wi...

Given an i.i.d. sequence of n letters from a finite alphabet, we consider the length of the longest run of any letter. In the equiprobable case, results for this run turn out to be closely related to the well-known results for the longest run of a given letter. For coin-tossing, tail probabilities are compared for both kinds of runs via Poisson approximation.