List Decodability at Small Radii

13 years 5 months ago

Download www1.spms.ntu.edu.sg

A (n,d,e), the smallest for which every binary error-correcting code of length n and minimum distance d is decodable with a list of size up to radius e, is determined for all d 2e-3. As a result, A (n,d,e) is determined for all e 4, except for 42 values of n. Keywords Bounded-weight codes

Yeow Meng Chee, Gennian Ge, Lijun Ji, San Ling, Ji

Real-time Traffic

Binary Error-correcting Code | CORR 2010 | Education |

claim paper

» Quantum List Decoding from Quantumly Corrupted Codewords for Classical Block Codes of Poly...

» A Lower Bound on List Size for List Decoding

» Ideal forms of Coppersmiths theorem and GuruswamiSudan list decoding

» Combinatorial bounds for list decoding

» ListDecoding Using The XOR Lemma

» List decoding tensor products and interleaved codes

» Proving HardCore Predicates Using List Decoding

» Approximate common divisors via lattices

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2010
Where	CORR
Authors	Yeow Meng Chee, Gennian Ge, Lijun Ji, San Ling, Jianxing Yin

Comments (0)

Sciweavers

List Decodability at Small Radii

Binary Error-correcting Code | CORR 2010 | Education |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers