Optimal coding with one asymmetric error: Below the sphere packing bound

DOI10.1007/3-540-44968-X_16MaRDI QIDQ2766824zbMATH OpenFDO

Authors Ferdinando Cicalese, Daniele Mundici

Publication date 22 October 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44968-X_16

zbMATH Keywords

asymmetric channelserror-correcting codeshalf-lie problemsphere packing boundUlam-Rényi problem

Mathematics Subject Classification ID

Bounds on codes (94B65)

Recommendations

• scientific article; zbMATH DE number 2091981
• Ulam-Rényi problem on searching with errors and optimal error-correcting codes
• scientific article; zbMATH DE number 512984
• scientific article; zbMATH DE number 1226239
• Searching with lies: The Ulam problem

Cited in

(8)

• The halflie problem.
• A halfliar's game
• On error correction with errors in both the channel and syndrome
• scientific article; zbMATH DE number 2091981 (Why is no real title available?)
• Ulam-Rényi problem on searching with errors and optimal error-correcting codes
• Searching games with errors -- fifty years of coping with liars
• Correcting a single error in an asymmetric feedback channel
• The Rényi-Ulam games and many-valued logics

This page was built for publication: Optimal coding with one asymmetric error: Below the sphere packing bound

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