Journal article
Fast decoding of codes from algebraic plane curves
Department of Photonics Engineering, Technical University of Denmark1
Coding and Visual Communication, Department of Photonics Engineering, Technical University of Denmark2
Department of Mathematics, Technical University of Denmark3
Discrete mathematics, Department of Mathematics, Technical University of Denmark4
Improvement to an earlier decoding algorithm for codes from algebraic geometry is presented. For codes from an arbitrary regular plane curve the authors correct up to d*/2-m2 /8+m/4-9/8 errors, where d* is the designed distance of the code and m is the degree of the curve. The complexity of finding the error locator is O(n7/3 ), where n is the length of the code.
For codes from Hermitian curves the complexity of finding the error values, given the error locator, is O(n2), and the same complexity can be obtained in the general case if only d*/2-m2/2 errors are corrected
Language: | English |
---|---|
Publisher: | IEEE |
Year: | 1992 |
Pages: | 111-119 |
ISSN: | 15579654 and 00189448 |
Types: | Journal article |
DOI: | 10.1109/18.108255 |
ORCIDs: | Larsen, Knud J. |