Name
Abstract | ||
|---|---|---|
A q-ary code of length n, size M, and minimum distanced is called an (n,M,d)q code. An (n,qk,n - k + 1)q code is called a maximum distance separable (MDS) code. In this paper, some MDS codes over small alphabets are classified. It is shown that every (k + d - 1, qk, d)q code with k ≥ 3, d ≥ 3, q ∈ (5, 7} is equivalent to a linear code with the same parameters. This implies that the (6, 54, 3)5 cod... |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/TIT.2015.2488659 | IEEE Transactions on Information Theory |
Keywords | DocType | Volume |
Hypercubes,Linear codes,Hamming distance,Parity check codes,Color,Indexes,Linearity | Journal | 61 |
Issue | ISSN | Citations |
12 | 0018-9448 | 8 |
PageRank | References | Authors |
0.70 | 5 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Janne I. Kokkala | 1 | 9 | 2.46 |
| Denis S. Krotov | 2 | 86 | 26.47 |
| Patric R. J. Östergård | 3 | 609 | 70.61 |