Self-dual Codes, Lattices, and Invariant Theory

  • David JoynerEmail author
  • Jon-Lark Kim
Part of the Applied and Numerical Harmonic Analysis book series (ANHA)


One of the most interesting fields in all of mathematics concerns the interaction between the fields of integral lattices, modular forms, invariant theory, and error-correcting codes. There are several excellent presentations in the literature of this subject, for example, Conway and Sloane (Sphere Packings, Lattices and Groups, 3rd edn. Springer, Berlin, 1999), Ebeling (Lattices and codes, 2nd edn. Vieweg, 2002), Elkies (Not. Am. Math. Soc. 47:1238–1245, 2000) Sloane (Proc. Symp. Pure Math., vol. 34, pp. 273–308. AMS, Providence, 1979), and Brualdi, Huffman, and Pless (Handbook of Coding Theory. Elsevier, New York, 1998). Therefore, this chapter will be brief and refer to these works for details.

Topics treated in this chapter include (a) invariant theory and the relationship with self-dual codes, (b) lattices and connections with binary codes, and (c) optimal, divisible, and extremal codes.

Some open questions which arise are: Which polynomials F(x,y) occur as the weight enumerators of linear codes? Does there exist a binary self-dual [72,36,16] code? These questions and others are discussed below.


Self-dual Codes Weight Enumerator Extremal Codes Linear Code Binary Extended Golay Code 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. [BDHO]
    Bannai, E., Dougherty, S.T., Harada, M., Oura, M.: Type II codes, even unimodular lattices, and invariant rings. IEEE Trans. Inf. Theory 45, 1194–1205 (1999)MathSciNetCrossRefGoogle Scholar
  2. [BSC]
    Bonnecaze, A., Calderbank, A.R., Solé, P.: Quaternary quadratic residue codes and unimodular lattices. IEEE Trans. Inf. Theory 41, 366–377 (1995)MathSciNetCrossRefGoogle Scholar
  3. [BHP]
    Brualdi, R., Huffman, W.C., Pless, V.: Handbook of Coding Theory. Elsevier, New York (1998)Google Scholar
  4. [CS1]
    Conway, J., Sloane, N.: Sphere Packings, Lattices and Groups, 3rd edn. Springer, Berlin (1999)CrossRefGoogle Scholar
  5. [CS3]
    Conway, J.H., Sloane, N.J.A.: A new upper bound on the minimal distance of self-dual codes. IEEE Trans. Inf. Theory 36, 1319–1333 (1990)MathSciNetCrossRefGoogle Scholar
  6. [Do]
    S. Dougherty webpage: Does there exist a [72, 36, 16] Type II code? (Last accessed 2009-5-7 at
  7. [D3]
    Duursma, I.: Extremal weight enumerators and ultraspherical polynomials. Discrete Math. 268(1–3), 103–127 (2003)MathSciNetCrossRefGoogle Scholar
  8. [Eb]
    Ebeling, W.: Lattices and Codes, 2nd edn. Vieweg, Wiesbaden (2002)CrossRefGoogle Scholar
  9. [E3]
    Elkies, N.: Lattices, linear codes and invariants. Not. Am. Math. Soc. 47, 1238–1245 (2000), 1382–1391MathSciNetzbMATHGoogle Scholar
  10. [GHKP]
    Gaborit, P., Cary Huffman, W., Kim, J.-L., Pless, V.: On additive codes over GF(4). In: DIMACS Workshop on Codes and Association Schemes. DIMACS Series in Discrete Math and Theoretical Computer Sciences, vol. 56, pp. 135–149. AMS, Providence (2001). Available: CrossRefGoogle Scholar
  11. [GPS]
    Greuel, G.-M., Pfister, G., Schönemann, H.: Singular 3.0. A Computer Algebra System for Polynomial Computations. Centre for Computer Algebra, University of Kaiserslautern (2005).
  12. [GHK]
    Gulliver, T.A., Harada, M., Kim, J.-L.: Construction of some extremal self-dual codes. Discrete Math. 263, 81–91 (2003)MathSciNetCrossRefGoogle Scholar
  13. [HK]
    Han, S., Kim, J.-L.: The nonexistence of near-extremal formally self-dual codes. Des. Codes Cryptogr. 51, 69–77 (2009)MathSciNetCrossRefGoogle Scholar
  14. [HLTP]
    Houghten, S.K., Lam, C.W.H., Thiel, L.H., Parker, J.A.: The extended quadratic residue code is the only (48,24,12) self-dual doubly-even code. IEEE Trans. Inf. Theory 49, 53–59 (2003)MathSciNetCrossRefGoogle Scholar
  15. [Hu]
    Huffman, W.C.: On the classification and enumeration of self-dual codes. Finite Fields Appl. 11, 451–490 (2005)MathSciNetCrossRefGoogle Scholar
  16. [HP1]
    Huffman, W.C., Pless, V.: Fundamentals of Error-Correcting Codes. Cambridge Univ. Press, Cambridge (2003)CrossRefGoogle Scholar
  17. [Ki1]
    Kim, J.-L.: A prize problem in coding theory. In: Sala, M., Mora, T., Perret, L., Sataka, S., Traverso, T. (eds.) Gröbner Basis, Coding, and Cryptography, pp. 373–376. Springer, Berlin (2009). Available: CrossRefGoogle Scholar
  18. [NRS]
    Nebe, G., Rains, E., Sloane, N.: Self-Dual Codes and Invariant Theory. Springer, Berlin (2006)zbMATHGoogle Scholar
  19. [OM]
    O’Meara, T.: Introduction to Quadratic Forms. Springer, Berlin (2000)zbMATHGoogle Scholar
  20. [Pl]
    Pless, V.: On the uniqueness of the Golay codes. J. Comb. Theory 5, 215–228 (1968)MathSciNetCrossRefGoogle Scholar
  21. [Ra]
    Rains, E.M.: Shadow bounds for self-dual codes. IEEE Trans. Inf. Theory 44, 134–139 (1998)MathSciNetCrossRefGoogle Scholar
  22. [Sl]
    Sloane, N.J.A.: Self-dual codes and lattices. In: Relations Between Combinatorics and Other Parts of Mathematics. Proc. Symp. Pure Math., vol. 34, pp. 273–308. American Mathematical Society, Providence (1979)CrossRefGoogle Scholar
  23. [S73]
    Sloane, N.J.A.: Is there a (72,36)d=16 self-dual code. IEEE Trans. Inf. Theory 19, 251 (1973)MathSciNetCrossRefGoogle Scholar
  24. [Z]
    Zhang, S.: On the nonexistence of extremal self-dual codes. Discrete Appl. Math. 91, 277–286 (1999)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  1. 1.Mathematics DepartmentUS Naval AcademyAnnapolisUSA
  2. 2.Department of MathematicsUniversity of LouisvilleLouisvilleUSA

Personalised recommendations