Abstract
We suggest a method of enumerative block encoding for sequences with constrained length of a run of zeros. Though the algorithm obtained coincides in form with the classical Bahl–Tang method, its application is extended to sequences with a wider class of constraints. We obtain recursion formulas for bit weights.
Similar content being viewed by others
REFERENCES
Babkin, V.F., A Universal Nonexponential Coding Method for Sources of Independent Messages, Probl. Peredachi Inf., 1971, vol. 7,no. 1, pp. 13-21.
Cover, T.M., Enumerative Source Encoding, IEEE Trans. Inf. Theory, 1973, vol. 19,no. 1, pp. 73-77.
Beenker, G.F.M. and Immink, K.A.S., A Generalized Method For Encoding and Decoding Run-Length-Limited Binary Sequences, IEEE Trans. Inf. Theory, 1983, vol. 29,no. 3, pp. 751-754.
Vasil'ev, P.I. and Kolesnik, V.D., Run-Length-Limited Codes, in Pomekhoustoichivoe kodirovanie i nadezhnost' EVM (Error-Resistant Coding and Reliability of Computers), Moscow: Nauka, 1987, pp. 95-109.
Tjalkens, T.J., On the Principal State Method for Run-Length Limited Sequences, IEEE Trans. Inf. Theory, 1994, vol. 40,no. 3, pp. 934-941.
Kautz, W.H., Fibonacci Codes for Synchronization Control, IEEE Trans. Inf. Theory, 1965, vol. 11,no. 2, pp. 284-292.
Tang, D.T. and Bahl, L.R., Block Codes for a Class of Constrained Noiseless Channels, Inf. Control, 1970, vol. 17,no. 5, pp. 436-461.
Rights and permissions
About this article
Cite this article
Kurmaev, O.F. Coding of Run-Length-Limited Sequences. Problems of Information Transmission 37, 216–225 (2001). https://doi.org/10.1023/A:1013826023436
Issue Date:
DOI: https://doi.org/10.1023/A:1013826023436