Abstract
We obtain an upper bound on the cardinality of a multiple packing in the case of a large decoding radius.
Similar content being viewed by others
References
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].
Blinovsky, V., Asymptotic Combinatorial Coding Theory, Boston: Kluwer, 1997.
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].
Author information
Authors and Affiliations
Corresponding author
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
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
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0032946009010013