Decoding of Reed Solomon codes beyond the error-correction bound
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4191094 (Why is no real title available?)
- scientific article; zbMATH DE number 3763833 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1306862 (Why is no real title available?)
- scientific article; zbMATH DE number 837790 (Why is no real title available?)
- Highly resilient correctors for polynomials
- On the hardness of computing the permanent of random matrices
- On the inherent intractability of certain coding problems (Corresp.)
- Reconstructing Algebraic Functions from Mixed Data
- The hardness of decoding linear codes with preprocessing
Cited in
(only showing first 100 items - show all)- Efficient decoding of Reed-Solomon codes beyond half the minimum distance
- New List Decoding Algorithms for Reed–Solomon and BCH Codes
- Power Decoding of Reed–Solomon Codes Revisited
- Pseudorandom generators without the XOR lemma
- Improved probabilistic decoding of interleaved Reed-Solomon codes and folded Hermitian codes
- Upper Bounds on the Number of Errors Corrected by the Koetter–Vardy Algorithm
- Theory of Cryptography
- Bounds on collaborative decoding of interleaved Hermitian codes and virtual extension
- Repairing Reed-solomon codes
- Gröbner basis solutions of constrained interpolation problems
- On deep holes of standard Reed-Solomon codes
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- Maximum-Likelihood Decoding of Reed–Solomon Codes is NP-Hard
- On the complexity of decoding Reed-Solomon codes (Corresp.)
- Fitting algebraic curves to noisy data
- Power error locating pairs
- Additive combinatorics: with a view towards computer science and cryptography -- an exposition
- Amplification and Derandomization without Slowdown
- A modified Guruswami-Sudan algorithm for decoding Reed-Solomon codes
- Improvements on the Johnson bound for Reed-Solomon codes
- ECC\(^2\): error correcting code and elliptic curve based cryptosystem
- On some computations on sparse polynomials
- List and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques
- Multi-trial Guruswami-Sudan decoding for generalised Reed-Solomon codes
- Noisy Chinese remaindering in the Lee norm
- Parameter choices on Guruswami-Sudan algorithm for polynomial reconstruction
- Decoding interleaved Reed-Solomon codes beyond their joint error-correcting capability
- Decoding interleaved Reed-Solomon codes over noisy channels
- List decoding of repeated codes
- On Reed-Solomon codes
- Extractors from Reed-Muller codes
- Scalable secure storage when half the system is faulty
- Key equations for list decoding of Reed-Solomon codes and how to solve them
- Behavioral Models for List Decoding
- Linear Diophantine Equations Over Polynomials and Soft Decoding of Reed–Solomon Codes
- The decoding of extended Reed-Solomon codes
- Computing minimal interpolation bases
- Finding smooth integers in short intervals using CRT decoding
- List decoding of Reed-Solomon codes from a Gröbner basis perspective
- Error-correcting codes against chosen-codeword attacks
- Correlated algebraic-geometric codes: Improved list decoding over bounded alphabets
- Factors of low individual degree polynomials
- On algorithms to find \(p\)-ordering
- On error distance of Reed-Solomon codes
- On deep holes of generalized Reed-Solomon codes
- List decodability at small radii
- On multi-trial Forney-Kovalev decoding of concatenated codes
- scientific article; zbMATH DE number 2038702 (Why is no real title available?)
- Optimal Rate List Decoding via Derivative Codes
- Maximum-likelihood decoding of Reed-Solomon codes is NP-hard
- List decoding of Hermitian codes using Gröbner bases
- Parameter choices and a better bound on the list size in the Guruswami-Sudan algorithm for algebraic geometry codes
- Big data interpolation using functional representation
- A Decoding Approach to Reed–Solomon Codes from Their Definition
- Decoding of Reed-Muller codes with a large number of errors
- Group homomorphisms as error correcting codes
- Polynomial root finding over local rings and application to error correcting codes
- Power decoding Reed-Solomon codes up to the Johnson radius
- New constructions for IPP codes
- Decoding Reed-Muller codes over product sets
- On the error distance of extended Reed-Solomon codes
- Gröbner basis approach to list decoding of algebraic geometry codes
- Complexity of Decoding Positive-Rate Primitive Reed–Solomon Codes
- New lower bounds for the minimum distance of generalized algebraic geometry codes
- Reconstructing Algebraic Functions from Mixed Data
- On the decoder error probability for Reed - Solomon codes (Corresp.)
- Pseudo-random generators for all hardnesses
- List-decoding Barnes-Wall lattices
- On the problem of increasing efficiency of Reed-Solomon-code-based algorithms for creating checkpoints for calculation applications
- Fast operations on linearized polynomials and their applications in coding theory
- Exploiting the cannibalistic traits of Reed-Solomon codes
- An application of bivariate polynomial factorization on decoding of Reed-Solomon based codes
- Efficient NIZKs from LWE via polynomial reconstruction and ``MPC in the head
- scientific article; zbMATH DE number 2081152 (Why is no real title available?)
- A Syndrome Formulation of the Interpolation Step in the Guruswami-Sudan Algorithm
- Optimal Rate List Decoding over Bounded Alphabets Using Algebraic-geometric Codes
- Nonlinear Repair of Reed-Solomon Codes
- List decoding of maximal order codes over number fields
- List Decoding of Binary Codes–A Brief Survey of Some Recent Results
- Parallel Hashing via List Recoverability
- A high dimensional Goldreich-Levin theorem
- Nearly optimal pseudorandomness from hardness
- Soft decoding of short/medium length codes using ordered statistics for quantum key distribution
- Collision Resistance from Multi-collision Resistance
- Efficient systolic multiplications in composite fields for cryptographic systems
- On list decoding of wavelet codes over finite fields of characteristic two
- Explicit list-decodable codes with optimal rate for computationally bounded channels
- Non-Black-Box Worst-Case to Average-Case Reductions Within \(\mathsf{NP}\)
- On 2-dimensional insertion-deletion Reed-Solomon codes with optimal asymptotic error-correcting capability
- On the error-correcting pair for MDS linear codes with even minimum distance
- Generalized Singleton Bound and List-Decoding Reed–Solomon Codes Beyond the Johnson Radius
- Asymptotic single-trial strategies for GMD decoding with arbitrary error-erasure tradeoff
- On the error-correcting radius of folded Reed-Solomon code designs
- Using the division algorithm to decode Reed-Solomon codes
- Collision-resistance from multi-collision-resistance
- Privacy-preserving verifiable delegation of polynomial and matrix functions
- The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs
- Decoding Folded Reed–Solomon Codes Using Hensel-Lifting
- Self-checking decoding algorithm for Reed-Solomon codes
- Reconstructive dispersers and hitting set generators
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)
