Comparison of two algorithms for decoding alternant codes

DOI10.1007/s002000050103zbMath0924.94034OpenAlexW2066186610MaRDI QIDQ1277244

Sylvia M. Jennings, Patrick Fitzpatrick

Publication date: 14 November 1999

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002000050103

zbMATH Keywords

computational complexitydecoding algorithmserror correcting alternant code

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Decoding (94B35)

Related Items (3)

Gröbner basis approach to list decoding of algebraic geometry codes ⋮ An iterative algorithm for parametrization of shortest length linear shift registers over finite chain rings ⋮ Gröbner bases over Galois rings with an application to decoding alternant codes

This page was built for publication: Comparison of two algorithms for decoding alternant codes