Skip to main content
SpringerLink
Log in

Weight distribution and dual distance

  • Published:
Applicable Algebra in Engineering, Communication and Computing Aims and scope

Abstract

Several results in coding theory (e.g. the Carlitz-Uchiyama bound) show that the weight distributions of certain algebraic codes of lengthn are concentrated aroundn/2 within a range of width √n. It is proved in this article that the extreme weights of a linear binary code of sufficiently high dual distance cannot be too close ton/2, the gap being of order √n. The tools used involve the Pless identities and the orthogonality properties of Krawtchouk polynomials, as well as estimates on their zeroes. As a by-product upper bounds on the minimum distance of self-dual binary codes are derived.

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. Berlekamp, E.: An introduction to coding theory. New York: McGraw Hill 1968

    Google Scholar 

  2. Comtet, L.: Analyse Combinatoire Tome 1, Presses Universitaires de france (1970)

  3. Conway, J. H., Sloane, N. J. A.: A New Upper Bound on the Minimal Distance of Self-Dual Codes. IEEE Trans. Inform. Theory, 36, IT-6 1319–1333 (1990)

    Google Scholar 

  4. Delsarte, P.: Four fundamental parameters of a code and their combinatorial significance, Infor. Control23, 407–438 (1973)

    Google Scholar 

  5. Delsarte, P.: An Algebraic Approach to the Association Schemes of Coding Theory, Philips Res. Repts [Suppl.] 10 (1973)

  6. Helleseth, T., Kløve, T., Mykkeltveit, J.: On the covering radius of binary codes. IEEE Trans. Inform. Theory, vol. IT-24, 5 September 1978

  7. Lachaud, G.: Artin-Schreier Curves, Exponential Sums, and the Carlitz-Uchiyama Bound for Geometric Codes. J. Number Theory (to appear)

  8. Laurent, M.: Upper Bounds for the Cardinalitys-Distances Codes. Europ. J. Combinatorics7, 27–41 (1986)

    Google Scholar 

  9. Levenshtein, V. I.: Bounds on the maximum size of a code with bounded scalar product modulus. Dokl. Akad. Nauk. SSSR263, 1303–1308 (1982)

    Google Scholar 

  10. MacWilliams, F. J.: Doctoral Dissertation (unpublished) (1961)

  11. MacWilliams, F. J., Sloane, N. J. A.: The theory of error-correcting codes. Amsterdam, North-Holland 1981

    Google Scholar 

  12. Rodier, F.: On the Spectra of the duals of Binary BCH Codes of Designed Distanceδ=9. IEEE Trans. Inform. Theory, vol. IT-38, 2, 478–479 (1992)

    Google Scholar 

  13. Solé P., Mehrothra, K.: Generalization of the Norse bound to Codes of Higher Strength. IEEE Trans. On Inform. Theory36, 1470–1472 (1990)

    Google Scholar 

  14. Szegö, G.: Orthogonal Polynomials. AMS Colloquium publications23, fourth edition (1975), reprinted (1985)

  15. A. Tietäväinen, A.: Covering Radius and Dual Distance, Designs, Codes. Cryptography1, 31–46 (1991)

    Google Scholar 

  16. Wolfmann, J.: Polynomial Description of Binary Linear Codes and Related Properties. AAECC2, 119–138 (1991)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire I.3.S., CNRS-URA 1376, Bâtiment 4, 250 rue Albert Einstein, Sophia-Antipolis, F-06560, Valbonne, France

    Patrick Solé

Authors
  1. Patrick Solé
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Solé, P. Weight distribution and dual distance. AAECC 5, 117–122 (1994). https://doi.org/10.1007/BF01438280

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01438280

Keywords

Search

Navigation