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

DOI10.1007/BF02917047zbMath0948.94018MaRDI QIDQ1286655

Guozhen Xiao, Linfang Zhou, Bao Li

Publication date: 26 November 2000

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

zbMATH Keywords

complexityalgorithmalgebraic-geometric codesdecodingBerlekamp-Massey algorithmrecurring relationminimal polynomial set

Mathematics Subject Classification ID

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

Related Items (1)

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

Cites Work

• Unnamed Item
• 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
• On the decoding of algebraic-geometric codes
• Generalized Berlekamp-Massey decoding of algebraic-geometric codes up to half the Feng-Rao bound
• Shift-register synthesis and BCH decoding

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