Name
Abstract | ||
|---|---|---|
Recently Bachoc and Gaborit introduced the notion of s-extremality for binary self-dual codes, generalizing Elkies' study on the highest possible minimum weight of the shadows of binary self-dual codes. In this paper, we introduce a concept of s-extremality for additive self-dual codes over F4, give a bound on the length of these codes with even distance d, classify them up to minimum distance d = 4, give possible lengths (only strongly conjectured for odd d) for which there exist s-extremal codes with 5 les d les 11, and give five s-extremal codes with d = 7 as well as four new s-extremal codes with d = 5. We also describe codes related to s-extremal codes |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1109/ISIT.2006.262035 | Seattle, WA |
Keywords | Field | DocType |
binary codes,dual codes,gf(4),additive self-dual codes,binary self-dual code shadow,code length,s-extremal additive codes,mathematics,hamming weight,upper bound | Discrete mathematics,Hamming code,Combinatorics,Concatenated error correction code,Luby transform code,Turbo code,Block code,Expander code,Reed–Muller code,Linear code,Mathematics | Conference |
ISBN | Citations | PageRank |
1-4244-0504-1 | 0 | 0.34 |
References | Authors | |
6 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bautista, E.P. | 1 | 0 | 0.34 |
| Gaborit, P. | 2 | 63 | 4.37 |
| Jon-Lark Kim | 3 | 312 | 34.62 |
| Walker, J.L. | 4 | 0 | 0.34 |