A class of Sudan-decodable codes

DOI10.1109/18.850696MaRDI QIDQ4503611zbMATH OpenOpenAlexFDO

Authors Rasmus Nielsen

Publication date 7 September 2000

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://orbit.dtu.dk/en/publications/ee29ab19-b504-405f-b8ba-9a647a3c0883

zbMATH Keywords

algebraic-geometry codesdecoding algorithmsHermitian codesReed-Solomon codesSudan's algorithm

Mathematics Subject Classification ID

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

Recommendations

• Sudan-decoding generalized geometric Goppa codes.
• scientific article; zbMATH DE number 1504671
• Generalized Sudan’s List Decoding for Order Domain Codes
• scientific article; zbMATH DE number 5380293
• List decoding of algebraic-geometric codes

Cited in

(9)

• Sudan-decoding generalized geometric Goppa codes.
• Noisy Chinese remaindering in the Lee norm
• On universally decodable matrices for space-time coding
• On Rosenbloom and Tsfasman's generalization of the Hamming space
• Linear codes on posets with extension property
• Bounds on the List-Decoding Radius of Reed--Solomon Codes
• Higher genus universally decodable matrices (UDMG)
• Generalized Sudan’s List Decoding for Order Domain Codes
• Fractional decoding and the Rosenbloom-Tsfasman metric

This page was built for publication: A class of Sudan-decodable codes

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