A class of Sudan-decodable codes

DOI10.1109/18.850696zbMath0997.94029OpenAlexW2155670728MaRDI QIDQ4503611

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

Reed-Solomon codesalgebraic-geometry codesdecoding algorithmsHermitian codesSudan's algorithm

Mathematics Subject Classification ID

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

Related Items (5)

On universally decodable matrices for space-time coding ⋮ Linear codes on posets with extension property ⋮ Higher genus universally decodable matrices (UDMG) ⋮ On Rosenbloom and Tsfasman's generalization of the Hamming space ⋮ Noisy Chinese remaindering in the Lee norm

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