Name
Abstract | ||
|---|---|---|
We study the problem of classifying deep holes of Reed-Solomon codes. We show that this problem is equivalent to the problem of classifying maximum distance separable (MDS) extensions of Reed-Solomon codes by one digit. This equivalence allows us to improve recent results on the former problem. In particular, we classify deep holes of Reed-Solomon codes of dimension greater than half the alphabet ... |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/TIT.2017.2706677 | IEEE Transactions on Information Theory |
Keywords | DocType | Volume |
Reed-Solomon codes,Generators,Parity check codes,Standards,Redundancy,Geometry,Terminology | Journal | 63 |
Issue | ISSN | Citations |
8 | 0018-9448 | 0 |
PageRank | References | Authors |
0.34 | 0 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Krishna V. Kaipa | 1 | 15 | 3.32 |