Name
Abstract | ||
|---|---|---|
We present the first two sub-quadratic complexity decoding algorithms for one-point Hermitian codes. The first is based on a fast realisation of the Guruswami–Sudan algorithm by using state-of-the-art algorithms from computer algebra for polynomial-ring matrix minimisation. The second is a Power decoding algorithm: an extension of classical key equation decoding which gives a probabilistic decoding algorithm up to the Sudan radius. We show how the resulting key equations can be solved by the matrix minimisation algorithms from computer algebra, yielding similar asymptotic complexities. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/TIT.2015.2424415 | IEEE Transactions on Information Theory |
Keywords | DocType | Volume |
ag codes,guruswami–sudan,hermitian codes,power decoding,list decoding | Journal | PP |
Issue | ISSN | Citations |
99 | 0018-9448 | 6 |
PageRank | References | Authors |
0.44 | 19 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Johan S. R. Nielsen | 1 | 6 | 0.44 |
| Peter Beelen | 2 | 16 | 2.11 |