List decoding reed-solomon, algebraic-geometric, and gabidulin subcodes up to the singleton bound
From MaRDI portal
Publication:5495856
DOI10.1145/2488608.2488715zbMath1293.94110OpenAlexW2068593329MaRDI QIDQ5495856
Xing, Chaoping, Venkatesan Guruswami
Publication date: 7 August 2014
Published in: Proceedings of the forty-fifth annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2488608.2488715
Linear codes (general theory) (94B05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Decoding (94B35)
Related Items (27)
Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases ⋮ Linear-time list recovery of high-rate expander codes ⋮ Optimal Rate List Decoding over Bounded Alphabets Using Algebraic-geometric Codes ⋮ Explicit subspace designs ⋮ On the geometry of balls in the Grassmannian and list decoding of lifted Gabidulin codes ⋮ Combinatorics. Abstracts from the workshop held January 1--7, 2023 ⋮ Fractional decoding of \(r\)-Hermitian codes ⋮ Almost affinely disjoint subspaces and covering Grassmannian codes ⋮ Generalized Singleton Bound and List-Decoding Reed–Solomon Codes Beyond the Johnson Radius ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Local List Recovery of High-Rate Tensor Codes and Applications ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Optimal rate algebraic list decoding using narrow ray class fields ⋮ Improved syndrome decoding of lifted \(L\)-interleaved Gabidulin codes ⋮ Almost affinely disjoint subspaces ⋮ Lossless dimension expanders via linearized polynomials and subspace designs ⋮ On syndrome decoding of punctured Reed-Solomon and Gabidulin codes ⋮ Row reduction applied to decoding of rank-metric and subspace codes ⋮ Algebraic decoding of folded Gabidulin codes ⋮ Subspace designs based on algebraic function fields ⋮ On the list decodability of self-orthogonal rank-metric codes ⋮ Unnamed Item ⋮ Some remarks on multiplicity codes ⋮ An asymptotically optimal construction of almost affinely disjoint subspaces ⋮ Low-Density Parity-Check Codes Achieve List-Decoding Capacity
This page was built for publication: List decoding reed-solomon, algebraic-geometric, and gabidulin subcodes up to the singleton bound
