Name
Abstract | ||
|---|---|---|
In this paper we classify all extremal and $s$-extremal binary self-dual codes of length 38. There are exactly 2744 extremal $[{38,19,8}]$ self-dual codes, two $s$-extremal $[{38,19,6}]$ codes, and 1730 $s$-extremal $[{38,19,8}]$ codes. We obtain our results from the use of a recursive algorithm used in the recent classification of all extremal self-dual codes of length 36, and from a generalization of this recursive algorithm for the shadow. The classification of $s$-extremal $[{38,19,6}]$ codes permits to achieve the classification of all $s$-extremal codes with $d=6$. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/TIT.2011.2177809 | IEEE Transactions on Information Theory |
Keywords | Field | DocType |
binary codes,classification algorithms,classification,generators,testing,vectors,recursive algorithm,discrete mathematics,shadow | Discrete mathematics,Shadow,Combinatorics,Recursion (computer science),Computer science,Block code,Binary code,Linear code,Statistical classification,Extremal length,Binary number | Journal |
Volume | Issue | ISSN |
58 | 4 | 0018-9448 |
Citations | PageRank | References |
8 | 0.79 | 9 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Carlos Aguilar Melchor | 1 | 266 | 20.27 |
| Philippe Gaborit | 2 | 700 | 56.29 |
| Jon-Lark Kim | 3 | 312 | 34.62 |
| Lin Sok | 4 | 47 | 10.38 |
| Patrick Solé | 5 | 636 | 89.68 |