Skip to main content

The Theorems of MacWilliams and Gleason

  • Chapter
A Short Course on Error Correcting Codes

Part of the book series: International Centre for Mechanical Sciences ((CISM,volume 188))

  • 97 Accesses

Abstract

In this chapter we prove two of the most remarkable results in all of coding theory. The first, due to Mrs. F.J. MacWilliams, says that the weigth enumeration of the dual code C is completely determined just by the weight enumerator of C. The second result, due to A.M. Gleason, states that the weight enumerator of any self-dual code (in which the weigth of any codeword is a multiple of 4) is a polynomial in the weigth enumerators of the extended Hamming code and the extended Golay code. This is an extremely powerful theorem for finding the minimum distance of large self-dual codes. It can also be used to show that certain codes do not exist.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berlekamp, E.R., F.J. MacWilliams and N.J.A. Sloane (1972), Gleason’s Theorem on Self-Dual Codes, PGIT 18: 409–414.

    MATH  MathSciNet  Google Scholar 

  2. Burnside, W. (1911), Theory of Groups of Finite Order, Second ed., Reprinted by Dover, N.Y. 1955.

    MATH  Google Scholar 

  3. Gleason, A.M. (1970), Weight Polynomials of Self-Dual Codes and the MacWilliams Identities, Actes, Congr. Inter. Math., Nice 1970, Gauthier-Villars, Paris, Vol. 3: 211–215.

    Google Scholar 

  4. Jacobson, N. (1964), Lectures in Abstract Algebra, Vol. 3, Van Nostrand, Princeton, N.J.

    Book  MATH  Google Scholar 

  5. Leontjev, V.K. (1973), Spectra of Linear Codes, Third International Symposium on Information Theory, Tallinn, Estonia, June 1973, Abstracts of Papers, Part II, pp. 102–106.

    Google Scholar 

  6. MacWilliams, F.J. (1962), Combinatorial Problems of Elementary Abelian Groups, Ph.D. Thesis, Dept. of Math., Harvard University, May, 1962.

    Google Scholar 

  7. MacWllliams, F.J., C.L. Mallows, and N.J.A. Sloane (1972), Generalizations of Gleason’s Theorem on Weight Enumerators of Self-Dual Codes, PGIT 18: 794–805.

    Google Scholar 

  8. Mallows, C.L. and N.J.A. Sloane (1973), An Upper Bound for Self-Dual Codes, IC 22: 188–200.

    MATH  MathSciNet  Google Scholar 

  9. Mallows, C.L. and N.J.A. Sloane (197), On the Invariants of a Linear Group of Order 336, Proc. Camb. Phil. Soc., To Appear.

    Google Scholar 

  10. Müller, G.A., H.F. Blichfeldt, and L.E. Dickson (1916), Theory and Applications of Finite Groups, Reprinted by Dover, N.Y. 1961.

    Google Scholar 

  11. Molien, T. (1897), Ueber die Invarianten der Linear Substitutionsgruppen, Sitzungsber. Koenig. Preuss. Akad. Wiss., pp. 1152–1156.

    Google Scholar 

  12. Weyl, H. (1946), The Classical Groups, Princeton University Press, Princeton, N.J.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer-Verlag Wien

About this chapter

Cite this chapter

Sloane, N.J.A. (1975). The Theorems of MacWilliams and Gleason. In: A Short Course on Error Correcting Codes. International Centre for Mechanical Sciences, vol 188. Springer, Vienna. https://doi.org/10.1007/978-3-7091-2864-0_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-7091-2864-0_4

  • Publisher Name: Springer, Vienna

  • Print ISBN: 978-3-211-81303-4

  • Online ISBN: 978-3-7091-2864-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics