Abstract
The problem of constructing asymptotic bounds for multiple packings in the space of q-ary sequences of length n is considered. For the zero rate, tightness of the expurgation bound is proved.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
Blinovsky, V.M., Asymptotic Combinatorial Coding Theory, Boston: Kluwer, 1997.
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.M., Bounds for Multiple Packing in q-ary Hamming Space, in Proc. 2002 IEEE Int. Symp. on Information Theory, Lausanne, Switzerland, 2002, p. 401.
Komlós, J., A Strange Pigeon-Hole Principle, Order, 1990, vol. 7, no.2, pp. 107–113.
Author information
Authors and Affiliations
Additional information
Translated from Problemy Peredachi Informatsii, No. 1, 2005, pp. 28–38.
Original Russian Text Copyright © 2005 by Blinovsky.
Supported in part by the Russian Foundation for Basic Research, project nos. 03-01-00592 and 03-01-00098.
Rights and permissions
About this article
Cite this article
Blinovsky, V.M. Code bounds for multiple packings over a nonbinary finite alphabet. Probl Inf Transm 41, 23–32 (2005). https://doi.org/10.1007/s11122-005-0007-5
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s11122-005-0007-5