Skip to main content
SpringerLink
Log in

A simple proof of the Delsarte inequalities

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

The Delsarte inequalities for a code {geC} are proved in two steps: The first inequality for {geC} is derived by a Plotkin-type argument. Then the κ-th inequality for {geC} turns out to be the first inequality for another code whose codeword list is obtained by taking the sums of κ columns from a codeword list of {geC}.

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

  • Delsarte, P. 1973. An algebraic approach to the association schemes of coding theory. Philips Research Reports Supplements 10: 26, 39.

    Google Scholar 

  • MacWilliams, F.J. 1963. A theorem on the distribution of weights in a systematic code. Bell Syst. Tech. J. 42: 79–94.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Informatics, Delft University of Technology, P.O. Box 356, 2600, AJ Delft, Holland

    Juriaan Simonis & Cornelis De Vroedt

Authors
  1. Juriaan Simonis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Cornelis De Vroedt
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by A. Tietäväinen

Rights and permissions

Reprints and permissions

About this article

Cite this article

Simonis, J., De Vroedt, C. A simple proof of the Delsarte inequalities. Des Codes Crypt 1, 77–82 (1991). https://doi.org/10.1007/BF00123961

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation