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

DOI10.1109/18.476248zbMath0847.94014OpenAlexW2145830640MaRDI QIDQ4880300

Tom Høholdt, Shojiro Sakata, Helge Elbrond Jensen

Publication date: 13 August 1996

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/f6b82cfc39966afc4fe3c576f43f56bd8aab64c0

zbMATH Keywords

algebraic-geometric codesdecodingBerlekamp-Massey algorithmFeng-Rao boundSakata algorithm

Mathematics Subject Classification ID

Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Decoding (94B35)

Related Items

On the evaluation codes given by simple \(\delta \)-sequences, A sequence of one-point codes from a tower of function fields, Decoding of differential AG codes, Aggregate error locator and error value computation in AG codes, Improved probabilistic decoding of interleaved Reed-Solomon codes and folded Hermitian codes, Evaluation codes defined by finite families of plane valuations at infinity, List decoding algorithm based on voting in Gröbner bases for general one-point AG codes, On the dimension of the subfield subcodes of 1-point Hermitian codes, Syndrome series of one point algebraic-geometric codes and majority voting scheme, A type of recurring relation on sequences and efficient decoding of a class of algebraic-geometric codes. II, A type of recurring relation on sequences and efficient decoding of a class of algebraic-geometric codes. I, Finding recursions for multidimensional arrays, The key equation for one-point codes and efficient error evaluation