On the Classification of Extremal Even Formally Self-DualCodes

  • Authors:
  • J. E. Fields;P. Gaborit;W. C. Huffman;V. Pless

  • Affiliations:
  • Department of Mathematics, Statistics, and Computer Science, University of Illinois–Chicago, 322 SEO, 851 S. Morgan, Chicago, IL 60607-7045, USA;INRIA—Department of Mathematics, Statistics, and Computer Science, University of Illinois–Chicago, 851 S. Morgan, Chicago, IL 60607-7045, USA;Department of Mathematical and Computer Sciences, Loyola University, Chicago, IL 60626, USA;Department of Mathematics, Statistics, and Computer Science, University of Illinois—Chicago, 322 SEO, 851 S. Morgan, Chicago, IL 60607-7045, USA

  • Venue:
  • Designs, Codes and Cryptography
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

Bachoc bachoc has recentlyintroduced harmonic polynomials for binary codes. Computing thesefor extremal even formally self-dual codes of length 12, shefound intersection numbers for such codes and showed that thereare exactly three inequivalent [12,6,4] even formally self-dualcodes, exactly one of which is self-dual. We prove a new theoremwhich gives a generator matrix for formally self-dual codes.Using the Bachoc polynomials we can obtain the intersection numbersfor extremal even formally self-dual codes of length 14. Thesesame numbers can also be obtained from the generator matrix.We show that there are precisely ten inequivalent [14,7,4] evenformally self-dual codes, only one of which is self-dual.