Generalized Singleton Bound and List-Decoding Reed–Solomon Codes Beyond the Johnson Radius
From MaRDI portal
Publication:6156027
Recommendations
- Combinatorial list-decoding of Reed-Solomon codes beyond the Johnson radius
- Bounds on the List-Decoding Radius of Reed--Solomon Codes
- Improvements on the Johnson bound for Reed-Solomon codes
- Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings
- On the List and Bounded Distance Decodability of Reed–Solomon Codes
Cites work
- scientific article; zbMATH DE number 3970683 (Why is no real title available?)
- scientific article; zbMATH DE number 1077413 (Why is no real title available?)
- scientific article; zbMATH DE number 1759459 (Why is no real title available?)
- scientific article; zbMATH DE number 6737879 (Why is no real title available?)
- A note on upper bounds for minimum distance codes
- Channel capacities for list codes
- Combinatorial bounds for list decoding
- Combinatorial list-decoding of Reed-Solomon codes beyond the Johnson radius
- Decoding of Reed Solomon codes beyond the error-correction bound
- Error-correcting codes for list decoding
- Every list-decodable code for high noise has abundant near-optimal rate puncturings
- Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
- Explicit subspace designs
- Extremal combinatorics. With applications in computer science
- Folded codes from function field towers and improved optimal rate list decoding
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- Limits to List Decoding Reed–Solomon Codes
- Linear-Algebraic List Decoding for Variants of Reed–Solomon Codes
- List decoding Reed-Solomon, algebraic-geometric, and Gabidulin subcodes up to the Singleton bound
- List-decoding multiplicity codes
- Maximum distance<tex>q</tex>-nary codes
- On the List and Bounded Distance Decodability of Reed–Solomon Codes
- On the List-Decodability of Random Linear Codes
- On the list decodability of random linear codes with large error rates
- Polynomial Codes Over Certain Finite Fields
- Restricted isometry of Fourier matrices and list decodability of random linear codes
- Subspace Polynomials and Limits to List Decoding of Reed–Solomon Codes
- ``Integer-making theorems
Cited in
(4)- Random shortening of linear codes and applications
- Correlated algebraic-geometric codes: Improved list decoding over bounded alphabets
- Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings
- Singleton-type bounds for list-decoding and list-recovery, and related results
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)
