Linear-Algebraic List Decoding for Variants of Reed–Solomon Codes
From MaRDI portal
Publication:5346487
Recommendations
- The Re-Encoding Transformation in Algebraic List-Decoding of Reed–Solomon Codes
- List decoding of Reed-Solomon codes from a Gröbner basis perspective
- Algebraic List-Decoding of Subspace Codes
- List decoding Reed-Solomon, algebraic-geometric, and Gabidulin subcodes up to the Singleton bound
- New List Decoding Algorithms for Reed–Solomon and BCH Codes
- List-Decoding Algorithms for Lifted Codes
- List-Decodability With Large Radius for Reed-Solomon Codes
- List decoding of algebraic-geometric codes
- List Decoding of<tex>$q$</tex>-ary Reed–Muller Codes
- A matrix based list decoding algorithm for linear codes over integer residue rings
Cited in
(22)- Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings
- List and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques
- List decoding of Reed-Solomon codes from a Gröbner basis perspective
- Key equations for list decoding of Reed-Solomon codes and how to solve them
- A matrix based list decoding algorithm for linear codes over integer residue rings
- Lossless dimension expanders via linearized polynomials and subspace designs
- Low-density parity-check codes achieve list-decoding capacity
- Explicit list-decodable codes with optimal rate for computationally bounded channels
- Generalized Singleton Bound and List-Decoding Reed–Solomon Codes Beyond the Johnson Radius
- Improved List Decoding of Generalized Reed–Solomon and Alternant Codes Over Galois Rings
- Simplified High-Speed High-Distance List Decoding for Alternant Codes
- Subspace designs based on algebraic function fields
- Optimal rate algebraic list decoding using narrow ray class fields
- Optimal Rate List Decoding over Bounded Alphabets Using Algebraic-geometric Codes
- scientific article; zbMATH DE number 7250144 (Why is no real title available?)
- Lifted Multiplicity Codes and the Disjoint Repair Group Property
- A Hensel lifting to replace factorization in list-decoding of algebraic-geometric and Reed-Solomon codes
- Explicit subspace designs
- Rank-metric codes and their applications
- On the error-correcting radius of folded Reed-Solomon code designs
- Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes
- Local list recovery of high-rate tensor codes and applications
This page was built for publication: Linear-Algebraic List Decoding for Variants of Reed–Solomon Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5346487)
