Generalized Berlekamp-Massey decoding of algebraic-geometric codes up to half the Feng-Rao bound

Authors:
S. Sakata;H. E. Jensen;T. Hoholdt
Affiliations:
Dept. of Comput. Sci. & Inf. Math., Univ. of Electro-Commun., Tokyo;-;-
Venue:
IEEE Transactions on Information Theory - Part 1
Year:
2006

Citing 0
Cited 8

Finding recursions for multidimensional arrays

Information and Computation
A Systolic Array Architecture for Fast Decoding of One-Point AG Codes and Scheduling of Parallel Processing on It

AAECC-13 Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Cited References

Computer algebra handbook
A sequence of one-point codes from a tower of function fields

Designs, Codes and Cryptography
Aggregate error locator and error value computation in AG codes

Journal of Combinatorial Theory Series A - Special issue in honor of Jacobus H. van Lint
Algebraic feedback shift registers based on function fields

SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
Improved probabilistic decoding of interleaved Reed-Solomon codes and folded Hermitian codes

Theoretical Computer Science
Evaluation codes defined by finite families of plane valuations at infinity

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

We treat a general class of algebraic-geometric codes and show how to decode these up to half the Feng-Rao bound, using an extension and modification of the Sakata algorithm (1990). The Sakata algorithm is a generalization to N dimensions of the classical Berlekamp-Massey algorithm