Coding for interactive communication: a survey
From MaRDI portal
Recommendations
Cited in
(20)- Making asynchronous distributed computations robust to noise
- Reliable communication over highly connected noisy networks
- Noisy beeping networks
- Toward coding for maximum errors in interactive communication
- Bridging the capacity gap between interactive and one-way communication
- Interactive information and coding theory
- scientific article; zbMATH DE number 6866311 (Why is no real title available?)
- Capacity of interactive communication over erasure channels and channels with feedback
- Making Asynchronous Distributed Computations Robust to Channel Noise
- scientific article; zbMATH DE number 7564410 (Why is no real title available?)
- Palette-alternating tree codes
- Efficient error-correcting codes for sliding windows
- Interactive function computation via polar coding
- Communication and information complexity
- Distributed CONGEST Algorithms against Mobile Adversaries
- The rate of interactive codes is bounded away from 1
- Interactive coding with unbounded noise
- Brief announcement: Content-oblivious leader election on rings
- The entropy of lies: playing twenty questions with a liar
- Content-oblivious leader election on rings
This page was built for publication: Coding for interactive communication: a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4600219)