Skip to main content
SpringerLink
Log in

Enumerative Coding for Constant-Weight Binary Sequences with Constrained Run-Length of Zeros

  • Published:
Problems of Information Transmission Aims and scope Submit manuscript

Abstract

We suggest a method for computing the number of dklr-sequences with given number of ones. Based on these results and the well-known method of Babkin and Cover, enumerative encoding and decoding for constant-weight dklr-sequences is obtained.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

REFERENCES

  1. 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. 5, pp. 751-754.

    Google Scholar 

  2. 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.

    Google Scholar 

  3. Kurmaev, O.F., Coding of Run-Length-Limited Sequences, Probl. Peredachi Inf., 2001, vol. 37, no. 3, pp. 34-43 [Probl. Inf. Trans. (Engl. Transl.), 2001, vol. 37, no. 3, pp. 216-225].

    Google Scholar 

  4. Schalkwijk, J.P.M., An Algorithm for Source Coding, IEEE Trans. Inf. Theory, 1972, vol. 18, no. 3, pp. 395-399.

    Google Scholar 

  5. Cover, T.M., Enumerative Source Encoding, IEEE Trans. Inf. Theory, 1973, vol. 19, no. 1, pp. 73-77.

    Google Scholar 

  6. Kautz, W.H., Fibonacci Codes for Synchronization Control, IEEE Trans. Inf. Theory, 1965, vol. 11, no. 2, pp. 284-292.

    Google Scholar 

  7. Riordan, J., An Introduction to Combinatorial Analysis, New York: Wiley, 1958. Translated under the title Vvedenie v kombinatornyi analiz, Moscow: Inostr. Lit., 1963.

    Google Scholar 

  8. Ferreira, H.C. and Lin, S., Error and Erasure Control (d; k) Block Codes, IEEE Trans. Inf. Theory, 1991, vol. 37, no. 5, pp. 1399-1408.

    Google Scholar 

  9. Babkin, V.F., A Universal Nonexponential Coding Method for Sources of Independent Messages, Probl. Peredachi Inf., 1971, vol. 7, no. 1, pp. 13-21.

    Google Scholar 

Download references

Authors
  1. O. F. Kurmaev
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kurmaev, O.F. Enumerative Coding for Constant-Weight Binary Sequences with Constrained Run-Length of Zeros. Problems of Information Transmission 38, 249–254 (2002). https://doi.org/10.1023/A:1022081311171

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1022081311171

Keywords

Search

Navigation