Zero error capacity under list decoding

DOI10.1109/18.21233zbMath0664.94009OpenAlexW1980392009MaRDI QIDQ3816014

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

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

Related Items (8)

On colorful edge triples in edge-colored complete graphs ⋮ New bounds for perfect \(k\)-hashing ⋮ List decoding ⋮ Beating Fredman-Komlós for Perfect k-Hashing. ⋮ Randomness in secret sharing and visual cryptography schemes ⋮ Beating Fredman-Komlós for perfect \(k\)-hashing ⋮ The hat guessing number of graphs ⋮ Search with noisy and delayed response

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