Decoding of Reed Solomon codes beyond the error-correction bound
From MaRDI portal
Publication:1361883
DOI10.1006/JCOM.1997.0439zbMATH Open0872.68026DBLPjournals/jc/Sudan97OpenAlexW2089272132WikidataQ100328979 ScholiaQ100328979MaRDI QIDQ1361883FDOQ1361883
Publication date: 16 September 1997
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/af0b6e11f66bebe3f0525fc31ccce7f309d74274
Recommendations
randomized algorithmdecoding of Reed-Solomon codesmaximum likelihood decoding algorithmpolynomial time bounded algorithm
Randomized algorithms (68W20) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Cyclic codes (94B15) Decoding (94B35)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the inherent intractability of certain coding problems (Corresp.)
- On the hardness of computing the permanent of random matrices
- Title not available (Why is that?)
- The hardness of decoding linear codes with preprocessing
- Highly resilient correctors for polynomials
- Title not available (Why is that?)
- Reconstructing Algebraic Functions from Mixed Data
- Title not available (Why is that?)
Cited In (only showing first 100 items - show all)
- 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
- Decoding of Reed-Muller codes with a large number of errors
- Gröbner basis approach to list decoding of algebraic geometry codes
- Fast operations on linearized polynomials and their applications in coding theory
- Title not available (Why is that?)
- New constructions for IPP codes
- Pseudo-random generators for all hardnesses
- List-decoding Barnes-Wall lattices
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- Key equations for list decoding of Reed-Solomon codes and how to solve them
- Parameter choices and a better bound on the list size in the Guruswami-Sudan algorithm for algebraic geometry codes
- Maximum-Likelihood Decoding of Reed–Solomon Codes is NP-Hard
- A modified Guruswami-Sudan algorithm for decoding Reed-Solomon codes
- ECC\(^2\): error correcting code and elliptic curve based cryptosystem
- Behavioral Models for List Decoding
- List decoding of Hermitian codes using Gröbner bases
- Big data interpolation using functional representation
- Bounds on collaborative decoding of interleaved Hermitian codes and virtual extension
- List decodability at small radii
- Decoding interleaved Reed-Solomon codes over noisy channels
- Correlated algebraic-geometric codes: Improved list decoding over bounded alphabets
- Decoding Reed-Solomon codes beyond \((d-1)/2\) and zeros of multivariate polynomials
- Optimal Rate List Decoding via Derivative Codes
- On the decoder error probability for Reed - Solomon codes (Corresp.)
- Power Decoding of Reed–Solomon Codes Revisited
- Reconstructing Algebraic Functions from Mixed Data
- Decoding interleaved Reed-Solomon codes beyond their joint error-correcting capability
- Factors of low individual degree polynomials
- Computing minimal interpolation bases
- On algorithms to find \(p\)-ordering
- Polynomial root finding over local rings and application to error correcting codes
- Pseudorandom generators without the XOR lemma
- Noisy Chinese remaindering in the Lee norm
- Linear Diophantine Equations Over Polynomials and Soft Decoding of Reed–Solomon Codes
- Complexity of Decoding Positive-Rate Primitive Reed–Solomon Codes
- On the error distance of extended Reed-Solomon codes
- On deep holes of standard Reed-Solomon codes
- Fitting algebraic curves to noisy data
- On the complexity of decoding Reed-Solomon codes (Corresp.)
- Improvements on the Johnson bound for Reed-Solomon codes
- Parameter choices on Guruswami-Sudan algorithm for polynomial reconstruction
- Scalable secure storage when half the system is faulty
- Gröbner basis solutions of constrained interpolation problems
- Finding smooth integers in short intervals using CRT decoding
- On multi-trial Forney-Kovalev decoding of concatenated codes
- A Decoding Approach to Reed–Solomon Codes from Their Definition
- New List Decoding Algorithms for Reed–Solomon and BCH Codes
- Variations on Muchnik's conditional complexity theorem
- Extractors from Reed-Muller codes
- On error distance of Reed-Solomon codes
- On deep holes of generalized Reed-Solomon codes
- Error-Correcting Codes Against Chosen-Codeword Attacks
- On Reed-Solomon codes
- Group homomorphisms as error correcting codes
- Power error locating pairs
- Upper Bounds on the Number of Errors Corrected by the Koetter–Vardy Algorithm
- Amplification and Derandomization without Slowdown
- Maximum-likelihood decoding of Reed-Solomon codes is NP-hard
- Repairing Reed-solomon codes
- List decoding of repeated codes
- New lower bounds for the minimum distance of generalized algebraic geometry codes
- Efficient decoding of Reed-Solomon codes beyond half the minimum distance
- The decoding of extended Reed-Solomon codes
- Title not available (Why is that?)
- Power decoding Reed-Solomon codes up to the Johnson radius
- Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition
- Nonlinear Repair of Reed-Solomon Codes
- Efficient systolic multiplications in composite fields for cryptographic systems
- Exploiting the cannibalistic traits of Reed-Solomon codes
- Non-Black-Box Worst-Case to Average-Case Reductions Within \(\mathsf{NP}\)
- Decoding Folded Reed–Solomon Codes Using Hensel-Lifting
- Parallel Hashing via List Recoverability
- On the Error-Correcting Radius of Folded Reed–Solomon Code Designs
- List-Decoding with Double Samplers
- Title not available (Why is that?)
- NP-Hardness of Reed--Solomon Decoding, and the Prouhet--Tarry--Escott Problem
- Efficient List Decoding of Explicit Codes with Optimal Redundancy
- Generalized Sudan’s List Decoding for Order Domain Codes
- Weight distributions for projective binary linear codes from Weil sums
- Title not available (Why is that?)
- Privacy-preserving verifiable delegation of polynomial and matrix functions
- ON LIST DECODING OF WAVELET CODES OVER FINITE FIELDS OF CHARACTERISTIC TWO
- List Decoding of Binary Codes–A Brief Survey of Some Recent Results
- 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
- Generalized Singleton Bound and List-Decoding Reed–Solomon Codes Beyond the Johnson Radius
- Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring
- The Vanishing Ideal of a Finite Set of Points with Multiplicity Structures
- List decoding of maximal order codes over number fields
- Simplified High-Speed High-Distance List Decoding for Alternant Codes
- A note on good permutation codes from Reed-Solomon codes
- Optimal Rate List Decoding over Bounded Alphabets Using Algebraic-geometric Codes
- Repairing Reed-Solomon Codes
- A Syndrome Formulation of the Interpolation Step in the Guruswami-Sudan Algorithm
- On building fine-grained one-way functions from strong average-case hardness
- Collision-resistance from multi-collision-resistance
This page was built for publication: Decoding of Reed Solomon codes beyond the error-correction bound
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1361883)
