Abstract | ||
---|---|---|
Algebraic-geometric (AG) codes have good error-correction capability due to their generally large code word length. However, their decoding remains complex, preventing practical applications. Addressing the challenge, this paper proposes two interpolation-based low-complexity Chase (LCC) decoding algorithms for one of the most popular AG codes-Hermitian codes. By choosing η unreliable symbols and ... |
Year | DOI | Venue |
---|---|---|
2018 | 10.1109/TCOMM.2017.2786667 | IEEE Transactions on Communications |
Keywords | Field | DocType |
Decoding,Interpolation,Complexity theory,Reliability,Algorithm design and analysis,Hamming distance,Simulation | Algorithm design,Computer science,Interpolation,Algorithm,Communication channel,Hamming distance,Code word,Decoding methods,Hermitian matrix,Computation | Journal |
Volume | Issue | ISSN |
66 | 4 | 0090-6778 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Siyuan Wu | 1 | 14 | 4.99 |
Li Chen | 2 | 36 | 7.36 |
Martin Johnston | 3 | 9 | 4.71 |