Name
Abstract | ||
|---|---|---|
The weight enumerator of a formally self-dual even code is obtained by the Gleason theorem. Recently, Kim and Pless gave some restrictions on the possible weight enumerators of near-extremal formally self-dual even codes of length divisible by eight. In this paper, the weight enumerators for which there is a near-extremal formally self-dual even code are completely determined for lengths 24 and 32, by constructing new near-extremal formally self-dual codes. We also give a classification of near- extremal double circulant codes of lengths 24 and 32. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/s10623-004-4037-6 | Des. Codes Cryptography |
Keywords | Field | DocType |
formally self-dual even codes, weight enumerators | Discrete mathematics,Combinatorics,Circulant matrix,Even code,Mathematics | Journal |
Volume | Issue | ISSN |
37 | 3 | 0925-1022 |
Citations | PageRank | References |
2 | 0.46 | 4 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| T. Aaron Gulliver | 1 | 864 | 143.47 |
| Masaaki Harada | 2 | 367 | 69.47 |
| Takuji Nishimura | 3 | 1240 | 126.89 |
| Patric R. J. Östergård | 4 | 609 | 70.61 |