On the Classification of Extremal Even Formally Self-Dual Codes |
| |
Authors: | J. E. Fields P. Gaborit W. C. Huffman V. Pless |
| |
Affiliation: | (1) Department of Mathematics, Statistics, and Computer Science, University of Illinois–Chicago, 322 SEO, 851 S. Morgan, Chicago, IL 60607-7045, USA;(2) Department of Mathematical and Computer Sciences, Loyola University, Chicago, IL 60626, USA |
| |
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. |
| |
Keywords: | Formally self-dual codes harmonic polynomials |
本文献已被 SpringerLink 等数据库收录! |
|