Decoding Hermitian codes with Sudan's algorithm

DOI10.1007/3-540-46796-3_26MaRDI QIDQ4502634zbMATH OpenFDO

Authors Tom Høholdt, Rasmus Nielsen

Publication date 14 January 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-46796-3_26

zbMATH Keywords

Hermitian codesimplementation of Sudan's algorithmlist decoding

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Number-theoretic algorithms; complexity (11Y16) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Decoding (94B35)

Recommendations

• List decoding of Hermitian codes using Gröbner bases
• List decoding of algebraic-geometric codes
• Decoding Reed-Solomon codes beyond half the minimum distance
• Efficient list decoding of a class of algebraic-geometry codes
• Hermitian codes as generalized Reed-Solomon codes

Cited in

(7)

• Sudan-decoding generalized geometric Goppa codes.
• Noisy Chinese remaindering in the Lee norm
• Bounds on collaborative decoding of interleaved Hermitian codes and virtual extension
• Gröbner basis approach to list decoding of algebraic geometry codes
• Improved probabilistic decoding of interleaved Reed-Solomon codes and folded Hermitian codes
• A class of Sudan-decodable codes
• List decoding of Hermitian codes using Gröbner bases

This page was built for publication: Decoding Hermitian codes with Sudan's algorithm

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