Abstract
The paper completes the proof of an upper bound for multiple packings in a q-ary Hamming space.
Similar content being viewed by others
References
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].
Blinovsky, V.M., Two Problems from Coding Theory, General Theory of Information Transfer and Combinatorics, Ahlswede, R., Bäumer, L., Cai, N., et al., Eds., Lect. Notes Comp. Sci., vol. 4123, Berlin: Springer, 2006, p. 1075.
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © V.M. Blinovsky, 2008, published in Problemy Peredachi Informatsii, 2008, Vol. 44, No. 1, pp. 38–44.
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. On the convexity of one coding-theory function. Probl Inf Transm 44, 34–39 (2008). https://doi.org/10.1134/S0032946008010031
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0032946008010031