Skip to main content
Log in

On the convexity of one coding-theory function

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

Abstract

The paper completes the proof of an upper bound for multiple packings in a q-ary Hamming space.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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., 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 

  2. 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.

    Chapter  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, 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

Reprints 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

Download citation

  • Received:

  • Published:

  • Issue Date:

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

Keywords

Navigation