Fast decoding of algebraic-geometric codes up to the designed minimum distance
| Autor: | Shojiro Sakata, T. Hoholdt, Jørn Justesen, Y. Madelung, H.E. Jensen |
|---|---|
| Rok vydání: | 1995 |
| Předmět: |
Discrete mathematics
Plane curve Berlekamp–Welch algorithm BCJR algorithm Concatenated error correction code List decoding Sequential decoding Serial concatenated convolutional codes Library and Information Sciences Computer Science Applications Computer Science::Discrete Mathematics Computer Science::Symbolic Computation Decoding methods Computer Science::Information Theory Information Systems Mathematics |
| Zdroj: | IEEE Transactions on Information Theory. 41:1672-1677 |
| ISSN: | 0018-9448 |
| DOI: | 10.1109/18.476240 |
| Popis: | We present a decoding algorithm for algebraic-geometric codes from regular plane curves, in particular the Hermitian curve, which corrects all error patterns of weight less than d*/2 with low complexity. The algorithm is based on the majority scheme of Feng and Rao (1993) and uses a modified version of Sakata's (1988) generalization of the Berlekamp-Massey algorithm. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|