Skip to main content
SpringerLink
Log in

The Grey-Rankin bound for nonbinary codes

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

Abstract

The Grey-Rankin bound for nonbinary codes is obtained. Examples of codes meeting this bound are given.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Grey, L.D., Some Bounds for Error-Correcting Codes, IEEE Trans. Inform. Theory, 1962, vol. 8, no. 2, pp. 200–202.

    Article  MATH  MathSciNet  Google Scholar 

  2. MacWilliams, F.J. and Sloane, N.J.A., The Theory of Error-Correcting Codes, Amsterdam: North-Holland, 1977. Translated under the title Teoriya kodov, ispravlyayushchikh oshibki, Moscow: Svyaz’, 1979.

    MATH  Google Scholar 

  3. Helleseth, T., Klove, T., and Levenshtein, V.L., A Bound for Codes with Given Minimum and Maximum Distances, in Proc. IEEE Int. Symp. on Information Theory, Seattle, USA, 2006, pp. 292–296.

  4. Beth, T., Jungnickel, D., and Lenz, H., Design Theory. Cambridge: Cambridge Univ. Press, 1993.

    Google Scholar 

  5. The CRC Handbook of Combinatorial Designs, Colbourn, C.J., and Dinitz, J.H., Eds., Boca Raton: CRC Press, 1996.

    MATH  Google Scholar 

  6. Dodunekov, S.M., Helleseth, T., and Zinoviev, V.A., On q-ary Grey-Rankin Bound and Codes Meeting This Bound, in Proc. 2004 IEEE Int. Symp. on Information Theory, Chicago, USA, 2004, p. 528.

  7. Delsarte, P., Two-Weight Linear Codes and Strongly Regular Graphs, MBLE Res. Lab. Report, Brussels, 1971, no. R160.

  8. Semakov, N.V., Zinoviev, V.A., and Zaitsev, G.V., A Class of Maximum Equidistant Codes, Probl. Peredachi Inf., 1969, vol. 5, no. 2, pp. 84–87 [Probl. Inf. Trans. (Engl. Transl.), 1969, vol. 5, no. 2. pp. 65–68].

    MATH  Google Scholar 

  9. Semakov, N.V. and Zinoviev, V.A., Equidistant q-ary Codes with Maximal Distance and Resolvable Balanced Incomplete Block Designs. Probl. Peredachi Inf., 1968, vol. 4, no. 2, pp. 3–10 [Probl. Inf. Trans. (Engl. Transl.), 1968, vol. 4, no. 2, pp. 1–7].

    MATH  Google Scholar 

  10. Fu, F.-W., Klove, T., and Shen, S.-Y., On the Hamming Distance between Two i.i.d. Random n-Tuples over a Finite Set, IEEE Trans. Inform. Theory, 1999, vol. 45, no. 2, pp. 803–807.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Information Transmission Problems, RAS, Moscow, Russia

    L. A. Bassalygo & V. A. Zinoviev

  2. Institute of Mathematies and Informaties, Bulgarian Academy of Sciences, Sofia, Bulgaria

    S. M. Dodunekov

  3. University of Bergen, Norway

    T. Helleseth

Authors
  1. L. A. Bassalygo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. M. Dodunekov
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. V. A. Zinoviev
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. T. Helleseth
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Original Russian Text Ş L.A. Bassalygo, S.M. Dodunekov, V.A. Zinoviev, T. Helleseth, 2006, published in Problemy Peredachi Informatsii, 2006, Vol. 42, No. 3, pp. 37–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

Bassalygo, L.A., Dodunekov, S.M., Zinoviev, V.A. et al. The Grey-Rankin bound for nonbinary codes. Probl Inf Transm 42, 197–203 (2006). https://doi.org/10.1134/S0032946006030033

Download citation

  • Received:

  • Accepted:

  • Issue Date:

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

Keywords

Search

Navigation