Error-correcting codes for list decoding
From MaRDI portal
Publication:3197766
DOI10.1109/18.61123zbMath0712.94021OpenAlexW2162725776MaRDI QIDQ3197766
Publication date: 1991
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.61123
Theory of error-correcting codes and error-detecting codes (94B99) Decoding (94B35) Communication theory (94A05)
Related Items (16)
Optimal Rate List Decoding over Bounded Alphabets Using Algebraic-geometric Codes ⋮ List Decoding of Binary Codes–A Brief Survey of Some Recent Results ⋮ A modified Guruswami-Sudan algorithm for decoding Reed-Solomon codes ⋮ Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes ⋮ Generalized Singleton Bound and List-Decoding Reed–Solomon Codes Beyond the Johnson Radius ⋮ Singleton-type bounds for list-decoding and list-recovery, and related results ⋮ Unnamed Item ⋮ Efficient List Decoding of Explicit Codes with Optimal Redundancy ⋮ Werner states and the two-spinors Heisenberg anti-ferromagnet ⋮ Gröbner basis approach to list decoding of algebraic geometry codes ⋮ Multiple packing in sum-type metric spaces ⋮ MUCHNIK DEGREES AND CARDINAL CHARACTERISTICS ⋮ Nearly optimal robust secret sharing ⋮ List decodability at small radii ⋮ New lower bounds on the fraction of correctable errors under list decoding in combinatorial binary communication channels ⋮ Gröbner basis solutions of constrained interpolation problems
This page was built for publication: Error-correcting codes for list decoding