Error-correcting codes for list decoding
From MaRDI portal
Recommendations
- Combinatorial bounds for list decoding
- Bounds for codes in the case of list decoding of finite volume
- New lower bounds on the fraction of correctable errors under list decoding in combinatorial binary communication channels
- List decoding of error-correcting codes. Winning thesis of the 2002 ACM Doctoral Dissertation Competition
- Improved lower bounds on the sizes of error-correcting codes for list decoding
Cited in
(38)- Bounds for codes in the case of list decoding of finite volume
- A coding theorem for multiple access channels using a maximum likelihood list decoding scheme
- On the theory of list decoding of convolutional codes
- Gröbner basis solutions of constrained interpolation problems
- A modified Guruswami-Sudan algorithm for decoding Reed-Solomon codes
- Nearly optimal robust secret sharing
- New lower bounds on the fraction of correctable errors under list decoding in combinatorial binary communication channels
- List decoding for a multiple access hyperchannel
- Gröbner basis approach to list decoding of algebraic geometry codes
- A weight-based characterization of the set of correctable error patterns under list-of-2 decoding
- Error-correcting codes against chosen-codeword attacks
- List Decoding of Crisscross Errors
- List Decoding for Binary Goppa Codes
- Bridging Shannon and Hamming: list error-correction with optimal rate
- Reduced lists of error patterns for maximum likelihood soft decoding
- Extractor Codes
- An Improved Bound on the List Error Probability and List Distance Properties
- List decoding of repeated codes
- scientific article; zbMATH DE number 4047591 (Why is no real title available?)
- Improved lower bounds on the sizes of error-correcting codes for list decoding
- Improved list-decodability of random linear binary codes
- Optimal Rate List Decoding over Bounded Alphabets Using Algebraic-geometric Codes
- List Decoding of Direct Sum Codes
- Muchnik degrees and cardinal characteristics
- List Decoding of Binary Codes–A Brief Survey of Some Recent Results
- Efficient List Decoding of Explicit Codes with Optimal Redundancy
- 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
- List decoding of Goppa codes in steganography
- Declipping and the recovery of vectors from saturated measurements
- Point-polynomial incidences theorem with an application to Reed-Solomon codes
- QuietOT: lightweight oblivious transfer with a public-key setup
- Codes for adversaries: between worst-case and average-case jamming
- List decodability at small radii
- Near-optimal list-recovery of linear code families
- Werner states and the two-spinors Heisenberg anti-ferromagnet
- Multiple packing in sum-type metric spaces
This page was built for publication: Error-correcting codes for list decoding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3197766)
