Skip to main content
SpringerLink
Log in

On enumeration of q-ary sequences with a fixed number of occurrences of the subblock 00

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

Abstract

We propose a method for computing the number of q-ary sequences that contain the subblock 00 precisely r times.

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. Vilenkin, N.Ya., Kombinatorika, Moscow: Nauka, 1969. Translated under the title Combinatorics, New York: Academic, 1971.

    Google Scholar 

  2. Guibas, L.J. and Odlyzko, A.M., String Overlaps, Pattern Matching and Nontransitive Games, J. Combin. Theory, Ser. A, 1981, vol. 30, no. 2, pp. 183–208.

    Article  MATH  MathSciNet  Google Scholar 

  3. Handbook of Combinatorics, Graham, R.L., Grötschel, M., and Lovász, L., Eds., Amsterdam: Elsevier; Cambridge: MIT Press, 1995, vol. 2.

    MATH  Google Scholar 

  4. Brualdi, R.A., Introductory Combinatorics, New York: North-Holland, 1977, 2nd ed.

    MATH  Google Scholar 

  5. Heubach, S. and Mansour, T., Combinatorics of Compositions and Words, Boca Raton: CRC Press, 2010.

    Google Scholar 

  6. Voronina, A.N., On Volumes of Spheres for the Stem Distance, Probl. Peredachi Inf., 2010, vol. 46, no. 1, pp. 9–19 [Probl. Inf. Trans. (Engl. Transl.), 2010, vol. 46, no. 1, pp. 7–16].

    MathSciNet  Google Scholar 

  7. D’yachkov, A.G., Vilenkin, P.A., Ismagilov, I.K., Sarbaev, R.S., Macula, A., Torney, D., and White, S., On DNA Codes, Probl. Peredachi Inf., 2005, vol. 41, no. 4, pp. 57–77 [Probl. Inf. Trans. (Engl. Transl.), 2005, vol. 41, no. 4, pp. 349–367].

    Google Scholar 

  8. D’yachkov, A.G. and Voronina, A.N., DNA Codes for Additive Stem Similarity, Probl. Peredachi Inf., 2009, vol. 45, no. 2, pp. 56–77 [Probl. Inf. Trans. (Engl. Transl.), 2009, vol. 45, no. 2, pp. 124–144].

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia

    V. S. Lebedev

Authors
  1. V. S. Lebedev
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to V. S. Lebedev.

Additional information

Original Russian Text © V.S. Lebedev, 2010, published in Problemy Peredachi Informatsii, 2010, Vol. 46, No. 4, pp. 116–121.

Supported in part by the Russian Foundation for Basic Research, project no. 09-01-00536.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lebedev, V.S. On enumeration of q-ary sequences with a fixed number of occurrences of the subblock 00. Probl Inf Transm 46, 376–381 (2010). https://doi.org/10.1134/S0032946010040071

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation