Skip to main content
Log in

Plotkin bound generalization to the case of multiple packings

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

Abstract

We obtain an upper bound on the cardinality of a multiple packing in the case of a large decoding radius.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Blinovsky, V.M., Bounds for Codes in the Case of Finite-Volume List Decoding, Probl. Peredachi Inf., 1986, vol. 22, no. 1, pp. 11–25 [Probl. Inf. Trans. (Engl. Transl.), 1986, vol. 22, no. 1, pp. 7–19].

    Google Scholar 

  2. Blinovsky, V., Asymptotic Combinatorial Coding Theory, Boston: Kluwer, 1997.

    MATH  Google Scholar 

  3. Blinovsky, V.M., Code Bounds for Multiple Packings over a Nonbinary Finite Alphabet, Probl. Peredachi Inf., 2005, vol. 41, no. 1, pp. 28–38 [Probl. Inf. Trans. (Engl. Transl.), 2005, vol. 41, no. 1, pp. 23–32].

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to V. M. Blinovsky.

Additional information

Original Russian Text © V.M. Blinovsky, 2009, published in Problemy Peredachi Informatsii, 2009, Vol. 45, No. 1, pp. 3–7.

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

Rights and permissions

Reprints and permissions

About this article

Cite this article

Blinovsky, V.M. Plotkin bound generalization to the case of multiple packings. Probl Inf Transm 45, 1–4 (2009). https://doi.org/10.1134/S0032946009010013

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

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

Keywords

Navigation