A type of recurring relation on sequences and efficient decoding of a class of algebraic-geometric codes. I

DOI10.1007/BF02917047MaRDI QIDQ1286655zbMATHFDO

Authors Bao Li, Linfang Zhou, Guozhen Xiao

Publication date 26 November 2000

Published in Science in China. Series E (Search for Journal in Brave)

zbMATH Keywords

algorithmcomplexitydecodingalgebraic-geometric codesBerlekamp-Massey algorithmminimal polynomial setrecurring relation

Mathematics Subject Classification ID

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

Recommendations

• A type of recurring relation on sequences and efficient decoding of a class of algebraic-geometric codes. II
• Simplified understanding and efficient decoding of a class of algebraic-geometric codes
• Syndrome series of one point algebraic-geometric codes and majority voting scheme

Cites work

• Algebraic coding theory
• Extension of the Berlekamp-Massey algorithm to N dimensions
• Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array
• Generalized Berlekamp-Massey decoding of algebraic-geometric codes up to half the Feng-Rao bound
• On the decoding of algebraic-geometric codes
• Shift-register synthesis and BCH decoding

Cited in

(3)

• Syndrome series of one point algebraic-geometric codes and majority voting scheme
• The Berlekamp-Massey algorithm and linear recurring sequences over a factorial domain
• A type of recurring relation on sequences and efficient decoding of a class of algebraic-geometric codes. II

This page was built for publication: A type of recurring relation on sequences and efficient decoding of a class of algebraic-geometric codes. I

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1286655)