Efficient list decoding of a class of algebraic-geometry codes
From MaRDI portal
Publication:540394
DOI10.3934/amc.2010.4.485zbMath1222.94045OpenAlexW2009890571MaRDI QIDQ540394
Kristian Brander, Beelen, Peter
Publication date: 3 June 2011
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2010.4.485
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Applications to coding theory and cryptography of arithmetic geometry (14G50) Decoding (94B35)
Related Items (8)
Arbitrarily varying multiple access channels with conferencing encoders: list decoding and finite coordination resources ⋮ Generalization of the Lee-O'Sullivan list decoding for one-point AG codes ⋮ Multi-trial Guruswami-Sudan decoding for generalised Reed-Solomon codes ⋮ Weighted Reed-Muller codes revisited ⋮ Improved power decoding of interleaved one-point Hermitian codes ⋮ Generic interpolation polynomial for list decoding ⋮ List decoding algorithm based on voting in Gröbner bases for general one-point AG codes ⋮ Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
Uses Software
This page was built for publication: Efficient list decoding of a class of algebraic-geometry codes
