Skip to main content
SpringerLink
Log in

Fast enumeration algorithm for words with given constraints on run lengths of ones

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

Abstract

We propose an algorithm for enumeration and denumeration of words with given constraints on run lengths of ones (dklr-sequences). For large n, operation time of the algorithm (per symbol of a sequence) is at most O(log3 n log log n), where n is the length of enumerated words, whereas for the best known methods it is at least cn, c > 0.

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. Medvedeva, Yu. and Ryabko, B., Fast Enumeration of Run-Length-Limited Words, in Proc. 2009 IEEE Int. Sympos. on Information Theory (ISIT’2009), Seoul, Korea, 2009, pp. 640–643.

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

    Article  MATH  MathSciNet  Google Scholar 

  3. Tang, D.T. and Bahl, L.R., Block Codes for a Class of Constrained Noiseless Channels, Information and Control, 1970, vol. 17, no. 5, pp. 436–461.

    Article  MATH  MathSciNet  Google Scholar 

  4. Beenker, G.F.M. and Immink, K.A.S., A Generalized Method For Encoding and Decoding Run-Length-Limited Binary Sequences, IEEE Trans. Inform. Theory, 1983, vol. 29, no. 5, pp. 751–754.

    Article  MATH  Google Scholar 

  5. Datta, S. and McLaughlin, S.W., An Enumerative Method for Runlength-Limited Codes: Permutation Codes, IEEE Trans. Inform. Theory, 1999, vol. 45, no. 6, pp. 2199–2204.

    Article  MATH  MathSciNet  Google Scholar 

  6. 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].

    MathSciNet  Google Scholar 

  7. Kurmaev, O.F., Enumerative Coding for Constant-Weight Binary Sequences with Constrained Run-Length of Zeros, Probl. Peredachi Inf., 2002, vol. 38, no. 4, pp. 3–9 [Probl. Inf. Trans. (Engl. Transl.), 2002, vol. 38, no. 4, pp. 249–254].

    MathSciNet  Google Scholar 

  8. Aho, A.V., Hopcroft, J.E., and Ullman, J.D., The Design and Analysis of Computer Algorithms, Reading: Addison-Wesley, 1976. Translated under the title Postroenie i analiz vychislitel’nykh algoritmov, Moscow: Mir, 1979.

    Google Scholar 

  9. Ryabko, B.Ya., Fast Enumeration of Combinatorial Objects, Diskret. Mat., 1998, vol. 10, no. 2, pp. 101–119 [Discrete Math. Appl. (Engl. Transl.), 2998, vol. 8, no. 2, pp. 163–182].

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Siberian State University of Telecommunication and Information Science, Novosibirsk, Russia

    Yu. S. Medvedeva

  2. Siberian Branch of the Russian Academy of Sciences, Siberian State University of Telecommunication and Information Science Institute of Computational Technologies, Novosibirsk, Russia

    B. Ya. Ryabko

Authors
  1. Yu. S. Medvedeva
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. B. Ya. Ryabko
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yu. S. Medvedeva.

Additional information

Original Russian Text © Yu.S. Medvedeva, B.Ya. Ryabko, 2010, published in Problemy Peredachi Informatsii, 2010, Vol. 46, No. 4, pp. 130–139.

Supported in part by the Russian Foundation for Basic Research, project no. 09-07-00005. Main results of the paper were announced in [1].

Rights and permissions

Reprints and permissions

About this article

Cite this article

Medvedeva, Y.S., Ryabko, B.Y. Fast enumeration algorithm for words with given constraints on run lengths of ones. Probl Inf Transm 46, 390–399 (2010). https://doi.org/10.1134/S0032946010040095

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0032946010040095

Keywords

Search

Navigation