The nonexistence of near-extremal formally self-dual codes
A code is called formally self-dual if and have the same weight enumerators. There are four types of nontrivial divisible formally self-dual codes over , and . These codes are called extremal if their minimum distances achieve the Mallows-Sloane bound. S. Zhang gave possible lengths for which extrem...
Gespeichert in:
Veröffentlicht in: | Designs, codes, and cryptography codes, and cryptography, 2009-04, Vol.51 (1), p.69-77 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | A code
is called formally self-dual if
and
have the same weight enumerators. There are four types of nontrivial divisible formally self-dual codes over
, and
. These codes are called extremal if their minimum distances achieve the Mallows-Sloane bound. S. Zhang gave possible lengths for which extremal self-dual codes do not exist. In this paper, we define near-extremal formally self-dual (f.s.d.) codes. With Zhang’s systematic approach, we determine possible lengths for which the four types of near-extremal formally self-dual codes as well as the two types of near-extremal formally self-dual additive codes cannot exist. In particular, our result on the nonexistence of near-extremal binary f.s.d. even codes of any
even
length
n
completes all the cases since only the case 8|
n
was dealt with by Han and Lee. |
---|---|
ISSN: | 0925-1022 1573-7586 |
DOI: | 10.1007/s10623-008-9244-0 |