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

List-decoding multiplicity codes
Polynomial Codes Over Certain Finite Fields
Title not available (Why is that?)
Explicit subspace designs
Maximum distance<tex>q</tex>-nary codes
Improved decoding of Reed-Solomon and algebraic-geometry codes
Decoding of Reed Solomon codes beyond the error-correction bound
Extremal combinatorics. With applications in computer science
On the List and Bounded Distance Decodability of Reed–Solomon Codes
Error-correcting codes for list decoding
Linear-Algebraic List Decoding for Variants of Reed–Solomon Codes
List decoding Reed-Solomon, algebraic-geometric, and Gabidulin subcodes up to the Singleton bound
Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
Folded codes from function field towers and improved optimal rate list decoding
``Integer-making theorems
Channel capacities for list codes
Title not available (Why is that?)
Every list-decodable code for high noise has abundant near-optimal rate puncturings
Combinatorial bounds for list decoding
Limits to List Decoding Reed–Solomon Codes
Combinatorial list-decoding of Reed-Solomon codes beyond the Johnson radius
Subspace Polynomials and Limits to List Decoding of Reed–Solomon Codes
A note on upper bounds for minimum distance codes
Title not available (Why is that?)
On the List-Decodability of Random Linear Codes
On the list decodability of random linear codes with large error rates
Title not available (Why is that?)
Efficient List-Decoding With Constant Alphabet and List Sizes
Restricted isometry of Fourier matrices and list decodability of random linear codes

Cited In (2)

Random shortening of linear codes and applications
Correlated algebraic-geometric codes: Improved list decoding over bounded alphabets

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6156027)