Name
Abstract | ||
|---|---|---|
An unrestricted q-ary maximum distance separable (MDS) code C with length n over an alphabet A (of size q) is a set of q(k) codewords that are elements of A(n), such that the smallest Hamming distance between two distinct codewords in C is d = n - k + 1. Sets of mutually orthogonal Latin squares of orders q <= 9, corresponding to q-ary MDS codes of size q(2), and q-ary one-error-correcting MDS codes for q <= 8 have been classified in earlier studies. These results are used here to complete the classification of all 7-ary and 8-ary MDS codes with d >= 3 using a computer search. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.3934/amc.2016020 | ADVANCES IN MATHEMATICS OF COMMUNICATIONS |
Keywords | Field | DocType |
MDS code,Classification,Latin hypercube | Discrete mathematics,Combinatorics,Separable space,Hamming distance,Graeco-Latin square,Computer search,Mathematics,Alphabet | Journal |
Volume | Issue | ISSN |
10 | SP3 | 1930-5346 |
Citations | PageRank | References |
1 | 0.41 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Janne I. Kokkala | 1 | 9 | 2.46 |
| Patric R. J. Östergård | 2 | 609 | 70.61 |