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)- Polynomial-time pseudodeterministic construction of primes
- Collision Resistance from Multi-collision Resistance
- Asymptotic single-trial strategies for GMD decoding with arbitrary error-erasure tradeoff
- Group homomorphisms as error correcting codes
- Factoring polynomials over function fields
- Cryptanalyzing the polynomial-reconstruction based public-key system under optimal parameter choice
- On list decoding of wavelet codes over finite fields of characteristic two
- Power error locating pairs
- NP-hardness of Reed-Solomon decoding, and the Prouhet-Tarry-Escott problem
- A high dimensional Goldreich-Levin theorem
- On the error-correcting pair for MDS linear codes with even minimum distance
- Upper Bounds on the Number of Errors Corrected by the Koetter–Vardy Algorithm
- On solving sparse polynomial factorization related problems
- On the error-correcting radius of folded Reed-Solomon code designs
- Using the division algorithm to decode Reed-Solomon codes
- Amplification and Derandomization without Slowdown
- Maximum-likelihood decoding of Reed-Solomon codes is NP-hard
- List decoding of repeated codes
- Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes
- Efficient NIZKs from LWE via polynomial reconstruction and ``MPC in the head
- Repairing Reed-solomon codes
- New lower bounds for the minimum distance of generalized algebraic geometry codes
- The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs
- Derandomization via symmetric polytopes: poly-time factorization of certain sparse polynomials
- On one-round reliable message transmission
- The decoding of extended Reed-Solomon codes
- Efficient decoding of Reed-Solomon codes beyond half the minimum distance
- Solving polynomial systems over non-fields and applications to modular polynomial factoring
- The average-case complexity of counting cliques in Erdős-Rényi hypergraphs
- Decoding Reed-Muller codes over product sets
- Fast Kötter-Nielsen-Høholdt interpolation over skew polynomial rings and its application in coding theory
- Power decoding Reed-Solomon codes up to the Johnson radius
- Point-polynomial incidences theorem with an application to Reed-Solomon codes
- Nearly optimal pseudorandomness from hardness
- scientific article; zbMATH DE number 2038702 (Why is no real title available?)
- Improved probabilistic decoding of interleaved Reed-Solomon codes and folded Hermitian codes
- Efficient systolic multiplications in composite fields for cryptographic systems
- Nonlinear Repair of Reed-Solomon 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
- Decoding of Reed-Muller codes with a large number of errors
- Gröbner basis approach to list decoding of algebraic geometry codes
- Exploiting the cannibalistic traits of Reed-Solomon codes
- Additive combinatorics: with a view towards computer science and cryptography -- an exposition
- Fast operations on linearized polynomials and their applications in coding theory
- On the structure of the Schur squares of twisted generalized Reed-Solomon codes and application to cryptanalysis
- New constructions for IPP codes
- On the problem of increasing efficiency of Reed-Solomon-code-based algorithms for creating checkpoints for calculation applications
- Decoding Folded Reed–Solomon Codes Using Hensel-Lifting
- List-decoding Barnes-Wall lattices
- Non-Black-Box Worst-Case to Average-Case Reductions Within \(\mathsf{NP}\)
- Parallel Hashing via List Recoverability
- Pseudo-random generators for all hardnesses
- 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
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- A modified Guruswami-Sudan algorithm for decoding Reed-Solomon codes
- List-Decoding with Double Samplers
- List decoding of Hermitian codes using Gröbner bases
- ECC\(^2\): error correcting code and elliptic curve based cryptosystem
- Maximum-Likelihood Decoding of Reed–Solomon Codes is NP-Hard
- Big data interpolation using functional representation
- Behavioral Models for List Decoding
- The vanishing ideal of a finite set of points with multiplicity structures
- Bounds on collaborative decoding of interleaved Hermitian codes and virtual extension
- List decodability at small radii
- scientific article; zbMATH DE number 2081152 (Why is no real title available?)
- Efficient List Decoding of Explicit Codes with Optimal Redundancy
- Decoding interleaved Reed-Solomon codes over noisy channels
- Weight distributions for projective binary linear codes from Weil sums
- Generalized Sudan’s List Decoding for Order Domain Codes
- Decoding Reed-Muller codes over product sets
- 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.)
- Correlated algebraic-geometric codes: Improved list decoding over bounded alphabets
- An improvement for error-correcting pairs of some special MDS codes
- Power Decoding of Reed–Solomon Codes Revisited
- scientific article; zbMATH DE number 7561748 (Why is no real title available?)
- Privacy-preserving verifiable delegation of polynomial and matrix functions
- An application of bivariate polynomial factorization on decoding of Reed-Solomon based codes
- Factors of low individual degree polynomials
- Reconstructing Algebraic Functions from Mixed Data
- Decoding interleaved Reed-Solomon codes beyond their joint error-correcting capability
- 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
- Computing minimal interpolation bases
- Error-correcting codes against chosen-codeword attacks
- Generalized Singleton Bound and List-Decoding Reed–Solomon Codes Beyond the Johnson Radius
- On algorithms to find \(p\)-ordering
- Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring
- Codes for adversaries: between worst-case and average-case jamming
- Polynomial root finding over local rings and application to error correcting codes
- Towards deterministic algorithms for constant-depth factors of constant-depth circuits
- Error correcting codes for uncompressed messages
- List-decodable Byzantine robust PIR: lower communication complexity, higher Byzantine tolerance, smaller list size
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)
