Improved decoding of Reed-Solomon and algebraic-geometry codes
From MaRDI portal
DOI10.1109/18.782097zbMATH Open0958.94036OpenAlexW2032431003WikidataQ56081976 ScholiaQ56081976MaRDI QIDQ4503371FDOQ4503371
Authors: Venkatesan Guruswami, Madhu Sudan 
Publication date: 7 September 2000
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/0269083a2194f257bdb81bef84790dcf51947772
Recommendations
Reed-Solomon codespolynomial time algorithmserror-correcting codealgebraic-geometry codeslist decoding algorithmweighted curve-fitting problem
Linear codes (general theory) (94B05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Decoding (94B35)
Cited In (only showing first 100 items - show all)
- Improved probabilistic decoding of interleaved Reed-Solomon codes and folded Hermitian codes
- Theory of Cryptography
- List and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques
- Multi-trial Guruswami-Sudan decoding for generalised Reed-Solomon codes
- List decoding of Reed-Solomon codes from a Gröbner basis perspective
- Generic interpolation polynomial for list decoding
- Gröbner basis approach to list decoding of algebraic geometry codes
- Multi-point codes from the GGS curves
- List decoding codes on Garcia-Stichtenoth tower using Gröbner basis
- A fuzzy vault scheme
- Extractor Codes
- Coding and Cryptography
- Gröbner bases and generalized Padé approximation
- Title not available (Why is that?)
- New constructions for IPP codes
- List-decoding Barnes-Wall lattices
- On representations of algebraic-geometry codes
- Multitrial decoding of concatenated codes using fixed thresholds
- Key equations for list decoding of Reed-Solomon codes and how to solve them
- ECC\(^2\): error correcting code and elliptic curve based cryptosystem
- Behavioral Models for List Decoding
- List decoding algorithm based on voting in Gröbner bases for general one-point AG codes
- List decoding of Hermitian codes using Gröbner bases
- Complexity of Decoding Positive-Rate Reed-Solomon Codes
- Title not available (Why is that?)
- An improved list decoding algorithm for the second order Reed-Muller codes and its applications
- Title not available (Why is that?)
- Correlated algebraic-geometric codes: Improved list decoding over bounded alphabets
- Optimal Rate List Decoding via Derivative Codes
- Almost separating and almost secure frameproof codes over \(q\)-ary alphabets
- Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
- List decoding Reed-Solomon, algebraic-geometric, and Gabidulin subcodes up to the Singleton bound
- Decoding interleaved Reed-Solomon codes beyond their joint error-correcting capability
- Factors of low individual degree polynomials
- Computing minimal interpolation bases
- A New Algorithm for Decoding Reed-Solomon Codes
- List decoding of error-correcting codes. Winning thesis of the 2002 ACM Doctoral Dissertation Competition
- Pseudorandom generators without the XOR lemma
- Decoding of redundant residue polynomial codes using Euclid's algorithm
- Weighted Reed-Muller codes revisited
- On some computations on sparse polynomials
- Linear Diophantine Equations Over Polynomials and Soft Decoding of Reed–Solomon Codes
- Algebraic soft-decision decoding of reed-solomon codes
- On the error distance of extended Reed-Solomon codes
- Noisy interpolation of sparse polynomials in finite fields
- On the List and Bounded Distance Decodability of Reed–Solomon Codes
- On deep holes of standard Reed-Solomon codes
- Efficient list decoding of a class of algebraic-geometry codes
- Gröbner basis solutions of constrained interpolation problems
- Key masking using biometry
- List Decoding for Binary Goppa Codes
- On multi-trial Forney-Kovalev decoding of concatenated codes
- Wild McEliece
- New List Decoding Algorithms for Reed–Solomon and BCH Codes
- On error distance of Reed-Solomon codes
- On deep holes of generalized Reed-Solomon codes
- On Reed-Solomon codes
- List decoding algorithms for certain concatenated codes
- Nonbinary quantum error-correcting codes from algebraic curves
- Group homomorphisms as error correcting codes
- Contemporary coding theory. Abstracts from the workshop held March 17--23, 2019
- Power error locating pairs
- Title not available (Why is that?)
- List decoding of matrix-product codes from nested codes: an application to quasi-cyclic codes
- List decoding of repeated codes
- A class of I.P.P. codes with efficient identification
- Improved partial permutation decoding for Reed-Muller codes
- Row reduction applied to decoding of rank-metric and subspace codes
- More results on the number of zeros of multiplicity at least \(r\)
- 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?)
- Power decoding Reed-Solomon codes up to the Johnson radius
- Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
- Generalization of the Lee-O'Sullivan list decoding for one-point AG codes
- Bounds on the List-Decoding Radius of Reed--Solomon Codes
- 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
- A modified Guruswami-Sudan algorithm for decoding Reed-Solomon codes
- Title not available (Why is that?)
- Bounds on collaborative decoding of interleaved Hermitian codes and virtual extension
- Efficient List Decoding of Explicit Codes with Optimal Redundancy
- Finding smooth integers in short intervals using CRT decoding
- Decoding interleaved Reed-Solomon codes over noisy channels
- Generalized Sudan’s List Decoding for Order Domain Codes
- Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC
- Weight distributions for projective binary linear codes from Weil sums
- Randomized decoding of Gabidulin codes beyond the unique decoding radius
- Decoding Reed-Solomon codes beyond \((d-1)/2\) and zeros of multivariate polynomials
- Privacy-preserving verifiable delegation of polynomial and matrix functions
- List Decoding of Binary Codes–A Brief Survey of Some Recent Results
- List Decoding of Generalized Reed–Solomon Codes Over Commutative Rings
- High-rate codes with sublinear-time decoding
- Linear-time list recovery of high-rate expander codes
- List decoding of number field codes
- Explicit list-decodable codes with optimal rate for computationally bounded channels
- On 2-dimensional insertion-deletion Reed-Solomon codes with optimal asymptotic error-correcting capability
- On the Doubly Sparse Compressed Sensing Problem
- Improved List Decoding of Generalized Reed–Solomon and Alternant Codes Over Galois Rings
This page was built for publication: Improved decoding of Reed-Solomon and algebraic-geometry codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4503371)
