Zero error capacity under list decoding

DOI10.1109/18.21233MaRDI QIDQ3816014zbMATH OpenOpenAlexFDO

Authors Peter Eliaš

Publication date 1989

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

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

zbMATH Keywords

list decodingnoiseless feedbackzero error channel capacities

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40) Decoding (94B35)

Recommendations

• Zero-error list capacities of discrete memoryless channels
• An upper bound on the zero-error list-coding capacity
• Erasure, list, and detection zero-error capacities for low noise and a relation to identification
• scientific article; zbMATH DE number 515918
• Lower bound on error probability in fixed-volume list decoding

Cited in

(16)

• List decoding
• Randomness in secret sharing and visual cryptography schemes
• Beating Fredman-Komlós for perfect \(k\)-hashing
• New bounds for perfect \(k\)-hashing
• On colorful edge triples in edge-colored complete graphs
• Search with noisy and delayed response
• Feedback Codes Achieving the Capacity of the Z-Channel
• scientific article; zbMATH DE number 515918 (Why is no real title available?)
• An upper bound on the zero-error list-coding capacity
• Zero-error list capacities of discrete memoryless channels
• Erasure, list, and detection zero-error capacities for low noise and a relation to identification
• Beating Fredman-Komlós for Perfect k-Hashing.
• An Improved Bound on the Zero-Error List-Decoding Capacity of the 4/3 Channel
• Zero Error List-Decoding Capacity of the q/(q–1) Channel
• Improved upper bound for the size of a trifferent code
• The hat guessing number of graphs

This page was built for publication: Zero error capacity under list decoding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3816014)