Efficient list decoding of a class of algebraic-geometry codes
DOI10.3934/AMC.2010.4.485zbMATH Open1222.94045OpenAlexW2009890571MaRDI QIDQ540394FDOQ540394
Authors: Kristian Brander, Peter Beelen 
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
Recommendations
- scientific article; zbMATH DE number 2081120
- List decoding of algebraic-geometric codes
- scientific article; zbMATH DE number 2081134
- A Hensel lifting to replace factorization in list-decoding of algebraic-geometric and Reed-Solomon codes
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- List decoding of Reed-Solomon codes from a Gröbner basis perspective
- Generic interpolation polynomial for list decoding
- A displacement approach to efficient decoding of algebraic-geometric codes
- Gröbner basis approach to list decoding of algebraic geometry codes
- Efficient root-finding algorithm with application to list decoding of algebraic-geometric codes
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Decoding (94B35)
Cited In (23)
- Bounds on the List-Decoding Radius of Reed--Solomon Codes
- Multi-trial Guruswami-Sudan decoding for generalised Reed-Solomon codes
- Generic interpolation polynomial for list decoding
- Minimum Distance Decoding of General Algebraic Geometry Codes via Lists
- Unique decoding of plane AG codes revisited
- A matrix based list decoding algorithm for linear codes over integer residue rings
- Parameter choices and a better bound on the list size in the Guruswami-Sudan algorithm for algebraic geometry codes
- List decoding algorithm based on voting in Gröbner bases for general one-point AG codes
- Correlated algebraic-geometric codes: Improved list decoding over bounded alphabets
- Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
- Simplified High-Speed High-Distance List Decoding for Alternant Codes
- Weighted Reed-Muller codes revisited
- Arbitrarily varying multiple access channels with conferencing encoders: list decoding and finite coordination resources
- Decoding of differential AG codes
- A Hensel lifting to replace factorization in list-decoding of algebraic-geometric and Reed-Solomon codes
- Title not available (Why is that?)
- Interpolation in list decoding of Reed-Solomon codes
- Cryptography and Coding
- Efficient root-finding algorithm with application to list decoding of algebraic-geometric codes
- Improved power decoding of interleaved one-point Hermitian codes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generalization of the Lee-O'Sullivan list decoding for one-point AG codes
Uses Software
This page was built for publication: Efficient list decoding of a class of algebraic-geometry codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q540394)
