One-way communication and error-correcting codes
From MaRDI portal
Publication:3547441
DOI10.1109/TIT.2003.813496zbMATH Open1301.94167OpenAlexW2104454746MaRDI QIDQ3547441FDOQ3547441
Authors: Alon Orlitsky, Krishnamurthy Viswanathan 
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2003.813496
Recommendations
- scientific article; zbMATH DE number 3972784
- Amplification of One-Way Information Complexity via Codes and Noise Sensitivity
- Bridging the capacity gap between interactive and one-way communication
- Towards coding for maximum errors in interactive communication
- scientific article; zbMATH DE number 4047591
Bounds on codes (94B65) Channel models (including quantum) in information and communication theory (94A40)
Cited In (5)
- A distributed computing perspective of unconditionally secure information transmission in Russian cards problems
- A lower bound on compression of unknown alphabets
- Information Exchange in the Russian Cards Problem
- Some aspects of the information theoretic dialogue
- Optimal Las Vegas reduction from one-way set reconciliation to error correction
This page was built for publication: One-way communication and error-correcting codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547441)
