Interactive coding over the noisy broadcast channel
From MaRDI portal
Recommendations
- Towards optimal deterministic coding for interactive communication
- Efficient Multiparty Interactive Coding—Part II: Non-Oblivious Noise
- Interactive Schemes for the AWGN Channel with Noisy Feedback
- Noisy Network Coding
- Maximal noise in interactive communication over erasure channels and channels with feedback
- Maximal Noise in Interactive Communication Over Erasure Channels and Channels With Feedback
- Explicit Capacity Approaching Coding for Interactive Communication
- Multicoding Schemes for Interference Channels
- Interactive Source Coding for Function Computation in Collocated Networks
- Linear Codes for Broadcasting With Noisy Side Information
Cited in
(10)- Noisy beeping networks
- List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise
- Constant-Rate Coding for Multiparty Interactive Communication Is Impossible
- Interactive information and coding theory
- Coding for interactive communication: a survey
- Algorithms for noisy broadcast with erasures
- Half-duplex communication complexity
- Information dissemination via broadcasts in the presence of adversarial noise
- Computation over the noisy broadcast channel with malicious parties
- Beeping deterministic congest algorithms in graphs
This page was built for publication: Interactive coding over the noisy broadcast channel
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5230314)