Name
Abstract | ||
|---|---|---|
All binary $[n,n/2]$ optimal self-dual codes for length $52\leq n\leq 60$ with an automorphism of order 7 or 13 are classified up to equivalence. Two of the constructed $[{54,27,10}]$ codes have weight enumerators that were not previously known to exist. There are also some $[{58,29,10}]$ codes with new values of the parameters in their weight enumerator. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/TIT.2011.2155619 | IEEE Transactions on Information Theory |
Keywords | Field | DocType |
binary self-dual codes,optimal self-dual code,weight enumerator,leq n,new value,weight enumerators,binary codes,vectors,generators,automorphisms,linear code,polynomials,support vector machine,support vector machines,bismuth | Hamming code,Discrete mathematics,Combinatorics,Concatenated error correction code,Group code,Low-density parity-check code,Block code,Expander code,Linear code,Reed–Muller code,Mathematics | Journal |
Volume | Issue | ISSN |
57 | 11 | 0018-9448 |
Citations | PageRank | References |
6 | 0.51 | 16 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nikolay Yankov | 1 | 56 | 7.51 |
| Radka Russeva | 2 | 26 | 3.84 |