Generalized Singleton Bound and List-Decoding Reed–Solomon Codes Beyond the Johnson Radius

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
``Integer-making theorems
Decoding of Reed Solomon codes beyond the error-correction bound
Explicit subspace designs
Some remarks on multiplicity codes
Extremal Combinatorics
Error-correcting codes for list decoding
A note on upper bounds for minimum distance codes
Polynomial Codes Over Certain Finite Fields
Limits to List Decoding Reed–Solomon Codes
Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
Improved decoding of Reed-Solomon and algebraic-geometry codes
Combinatorial bounds for list decoding
Subspace Polynomials and Limits to List Decoding of Reed–Solomon Codes
Efficient List-Decoding With Constant Alphabet and List Sizes
Combinatorial list-decoding of Reed-Solomon codes beyond the Johnson radius
Channel capacities for list codes
Every list-decodable code for high noise has abundant near-optimal rate puncturings
On the List-Decodability of Random Linear Codes
Linear-Algebraic List Decoding for Variants of Reed–Solomon Codes
Folded codes from function field towers and improved optimal rate list decoding
On the List and Bounded Distance Decodability of Reed–Solomon Codes
List decoding reed-solomon, algebraic-geometric, and gabidulin subcodes up to the singleton bound
On the list decodability of random linear codes with large error rates
Maximum distance<tex>q</tex>-nary codes
Restricted Isometry of Fourier Matrices and List Decodability of Random Linear Codes

This page was built for publication: Generalized Singleton Bound and List-Decoding Reed–Solomon Codes Beyond the Johnson Radius