Name
Abstract | ||
|---|---|---|
All linear binary codes with minimum distance 8 and codimension up to 14 and all codes with minimum distance 10 and codimension up to 18 are classified. Nonexistence of codes with parameters [33,18,8] and [33,14,10] is proved. This leads to 8 new exact bounds for binary linear codes. Primarily two algorithms considering the dual codes are used, namely extension of dual codes with a proper coordinate, and a fast algorithm for finding a maximum clique in a graph, which is modified to find a maximum set of vectors with the right dependency structure. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/TIT.2011.2162264 | IEEE Transactions on Information Theory |
Keywords | DocType | Volume |
information theory,linear code | Journal | 57 |
Issue | ISSN | Citations |
9 | 0018-9448 | 1 |
PageRank | References | Authors |
0.41 | 6 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| I. G. Bouyukliev | 1 | 1 | 0.75 |
| E. Jacobsson | 2 | 1 | 0.41 |