On the List and Bounded Distance Decodability of Reed–Solomon Codes
From MaRDI portal
Publication:5454248
DOI10.1137/S0097539705447335zbMath1189.94056arXivmath/0405082OpenAlexW2174870427MaRDI QIDQ5454248
Publication date: 28 March 2008
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0405082
discrete logarithm problemReed-Solomon codeslist decoding algorithmbounded distance decoding algorithm
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Bounds on codes (94B65) Number-theoretic algorithms; complexity (11Y16) Decoding (94B35)
Related Items (18)
On the error distance of extended Reed-Solomon codes ⋮ Subset sums of quadratic residues over finite fields ⋮ NP-Hardness of Reed--Solomon Decoding, and the Prouhet--Tarry--Escott Problem ⋮ Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings ⋮ A new sieve for distinct coordinate counting ⋮ Generalized Singleton Bound and List-Decoding Reed–Solomon Codes Beyond the Johnson Radius ⋮ On the error-correcting pair for MDS linear codes with even minimum distance ⋮ On Reed-Solomon codes ⋮ Cyclic codes from cyclotomic sequences of order four ⋮ An asymptotic formula for counting subset sums over subgroups of finite fields ⋮ Constructions of cyclic quaternary constant-weight codes of weight three and distance four ⋮ The \(k\)-subset sum problem over finite fields ⋮ On the subset sum problem over finite fields ⋮ A new sieve for restricted multiset counting ⋮ Distinct coordinate solutions of linear equations over finite fields ⋮ On deep holes of Gabidulin codes ⋮ On error distance of Reed-Solomon codes ⋮ Proving primality in essentially quartic random time
This page was built for publication: On the List and Bounded Distance Decodability of Reed–Solomon Codes
