Fast decoding of codes from algebraic plane curves
- 1 January 1992
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 38 (1) , 111-119
- https://doi.org/10.1109/18.108255
Abstract
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 correctedKeywords
This publication has 9 references indexed in Scilit:
- On the decoding of algebraic-geometric codesIEEE Transactions on Information Theory, 1990
- Extension of the Berlekamp-Massey algorithm to N dimensionsInformation and Computation, 1990
- On the decoding of algebraic-geometric codes over F/sub q/ for q<or=16IEEE Transactions on Information Theory, 1990
- Construction and decoding of a class of algebraic geometry codesIEEE Transactions on Information Theory, 1989
- On a decoding algorithm for codes on maximal curvesIEEE Transactions on Information Theory, 1989
- A note on Hermitian codes over GF(q/sup 2/)IEEE Transactions on Information Theory, 1988
- Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional arrayJournal of Symbolic Computation, 1988
- On determining the independent point set for doubly periodic arrays and encoding two-dimensional cyclic codes and their dualsIEEE Transactions on Information Theory, 1981
- Shift-register synthesis and BCH decodingIEEE Transactions on Information Theory, 1969