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

DOI10.1007/BF02917055zbMath0948.94019OpenAlexW3112130401MaRDI QIDQ1283084

Linfang Zhou, Bao Li, Guozhen Xiao

Publication date: 26 November 2000

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

Full work available at URL: https://doi.org/10.1007/bf02917055

zbMATH Keywords

complexityalgebraic-geometric codesgeneralized Berlekamp-Massey algorithmmajority voting schemedecoding algorithmsFeng-Rao boundrecurring relation

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• A type of recurring relation on sequences and efficient decoding of a class of algebraic-geometric codes. I
• Decoding algebraic-geometric codes up to the designed minimum distance
• Majority coset decoding
• Simplified understanding and efficient decoding of a class of algebraic-geometric codes
• On the decoding of algebraic-geometric codes
• Decoding geometric Goppa codes up to designed minimum distance by solving a key equation in a ring
• Generalized Berlekamp-Massey decoding of algebraic-geometric codes up to half the Feng-Rao bound

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