Methods are presented for the encoding of information into binary sequences in which the number of ZEROS occurring between each pair of successive ONES has both an upper and a lower bound. The techniques, based on the state structure of the constraints, permit the construction of short, efficient codes with favorable error-propagation-limiting properties.
No takes yet. Share an insight, caveat, or question.
P. A. Franaszek (1970) studied this question.