Skip to main content
Log in

On the Classification of Extremal Even Formally Self-Dual Codes

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

Abstract

Bachoc bachoc has recently introduced harmonic polynomials for binary codes. Computing these for extremal even formally self-dual codes of length 12, she found intersection numbers for such codes and showed that there are exactly three inequivalent [12,6,4] even formally self-dual codes, exactly one of which is self-dual. We prove a new theorem which gives a generator matrix for formally self-dual codes. Using the Bachoc polynomials we can obtain the intersection numbers for extremal even formally self-dual codes of length 14. These same numbers can also be obtained from the generator matrix. We show that there are precisely ten inequivalent [14,7,4] even formally self-dual codes, only one of which is self-dual.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. E. F. Assmus and J. D. Key, Designs and Their Codes, University Press, Cambridge (1992).

    Google Scholar 

  2. C. Bachoc, On harmonic weight enumerators of binary codes, To appear in this volume of DESI, pp. 11-28.

  3. W. Bosma and J. Cannon, Handbook of Magma Functions, Sydney (1995).

  4. A. E. Brouwer, Bounds on the size of linear codes, (V. Pless and W. C. Huffman, eds.), Handbook of Coding Theory, Amsterdam, North Holland/Elsevier (1998).

    Google Scholar 

  5. A. E. Brouwer and M. Voorhoeve, Turán theory and the lotto problem, Mathematical Centre Tracts, Vol. 106 (1979) pp. 99-105.

    Google Scholar 

  6. J. E. Fields and V. Pless, Split weight enumerators of extremal self-dual codes, Proceedings, 35th Annual Allerton Conference on Communication, Control and Computing, (1997) pp. 422-431.

  7. J. E. Fields, P. Gaborit, W. C. Huffman and V. Pless, On the classification of extremal even formally self-dual codes of lengths 20 and 22, preprint.

  8. G. T. Kennedy and V. Pless, On designs and formally self-dual codes, Designs, Codes and Cryptography, Vol. 4 (1994) pp. 43-55.

    Google Scholar 

  9. D. Jaffe, Optimal binary linear codes of length ≤ 30, to appear in Discrete Math.

  10. V. Pless, On the uniqueness of the Golay codes, J. Comb. Theory, Vol. 5 (1968) pp. 215-228.

    Google Scholar 

  11. V. Pless, A classification of self-orthogonal codes over GF(2), Discrete Math., Vol. 3 (1972) pp. 209-246.

    Google Scholar 

  12. V. Pless, Constraints on weights in binary codes, AAECC, Vol. 8 (1997) pp. 411-414.

    Google Scholar 

  13. V. Pless, Introduction to the Theory of Error Correcting Codes, Wiley, New York, 3rd edition (1998).

    Google Scholar 

  14. V. Pless and N. J. A. Sloane, On the classification and enumerration of self-dual codes, J. Combin. Theory Ser. A, Vol. 18, (1975) pp. 313-335.

    Google Scholar 

  15. E. M. Rains and N. J. A. Sloane, Self-dual codes, (V. Pless and W. C. Huffman, eds.), Handbook of Coding Theory, North Holland, Amsterdam (1998).

    Google Scholar 

  16. M. Schönert et al., GAP—Groups, Algorithms, and Programming. Lehrstuhl D für Mathematik, Rheinisch Westfälische Technische Hochschule, Aachen, Germany, fifth edition (1995).

    Google Scholar 

  17. J. Simonis, The [18,9,6] code is unique, Discrete Math., Vol. 106/107 (1992) pp. 439-448.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fields, J.E., Gaborit, P., Huffman, W.C. et al. On the Classification of Extremal Even Formally Self-Dual Codes. Designs, Codes and Cryptography 18, 125–148 (1999). https://doi.org/10.1023/A:1008389220478

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008389220478

Navigation