Name
Abstract | ||
|---|---|---|
A q-ary code of length n, size M, and minimum distance d is called an (n, M, d) q code. An (n, q(k), d)(q) code with d = n - k + 1 is said to be maximum distance separable (MDS). Here we show that every code with parameters (k + d - 1, q(k), d)(q) where k, d = 3 and q = 5, 7, is equivalent to a linear code, which implies that the (6, 5(4), 3)(5) code and the (n, 7(n-2), 3)(7) codes for n = 6, 7, 8 are unique. We also show that there are 14, 8, 4, and 4 equivalence classes of (n, 8(n-2), 3)(8) codes for n = 6, 7, 8, 9, respectively. This work is continuation of a previous article classifying (5, q(3), 3)(q) codes for q = 5, 7, 8. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/978-3-319-17296-5_24 | CIM Series in Mathematical Sciences |
Keywords | DocType | Volume |
Classification,MDS codes,Perfect codes,Latin hypercubes | Conference | 3 |
ISSN | Citations | PageRank |
2364-950X | 0 | 0.34 |
References | Authors | |
0 | 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 |