Aggregate error locator and error value computation in AG codes

DOI10.1016/J.JCTA.2006.03.016zbMath1105.94020OpenAlexW2062184531MaRDI QIDQ855879

P. Le Bars, Ph. Piret

Publication date: 7 December 2006

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2006.03.016

zbMATH Keywords

aggregatesAG codeserror locating idealerror value computationweight achieving pair

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Applications to coding theory and cryptography of arithmetic geometry (14G50) Decoding (94B35)

Cites Work

• Algebraic function fields and codes
• A fast decoding method of AG codes from Miura-Kamiya curves \(C_{ab}\) up to half the Feng-Rao bound
• On the Structure of Hermitian Codes and Decoding for Burst Errors
• Decoding algebraic-geometric codes up to the designed minimum distance
• Fast decoding of algebraic-geometric codes up to the designed minimum distance
• Decoding of codes defined by a single point on a curve
• Generalized Berlekamp-Massey decoding of algebraic-geometric codes up to half the Feng-Rao bound
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Aggregate error locator and error value computation in AG codes