Improved lower bounds on the sizes of error-correcting codes for list decoding

DOI10.1109/18.312186zbMATH Open0806.94027OpenAlexW2150947719MaRDI QIDQ4308802FDOQ4308802

Authors:

Publication date: 10 October 1994

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.312186

Recommendations

• Combinatorial bounds for list decoding
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• Error-correcting codes for list decoding
• Improved lower bounds on sizes of single-error correcting codes
• Publication:4945066

zbMATH Keywords

lower boundserror correcting codeslist decoding

Mathematics Subject Classification ID

Communication theory (94A05) Decoding (94B35) Theory of error-correcting codes and error-detecting codes (94B99)

Cited In (9)

• Lower bound for the linear multiple packing of the binary Hamming space
• Comment on "Improved Analysis of List Decoding and Its Application to Convolutional Codes and Turbo Codes
• Error-correcting codes for list decoding
• Title not available (Why is that?)
• Reduced lists of error patterns for maximum likelihood soft decoding
• An Improved Bound on the Zero-Error List-Decoding Capacity of the 4/3 Channel
• Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes
• Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets
• Title not available (Why is that?)

This page was built for publication: Improved lower bounds on the sizes of 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 Q4308802)