Coding for interactive communication
From MaRDI portal
Publication:3129462
DOI10.1109/18.556671zbMATH Open0873.94007OpenAlexW2115551261MaRDI QIDQ3129462FDOQ3129462
Publication date: 20 October 1997
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://resolver.caltech.edu/CaltechAUTHORS:SCHUieeetit96
distributed computingerror correctiontree codecoding theoremreliable communicationinteractive communication
Cited In (26)
- Dimension reduction for finite trees in \(\ell_1\)
- Computing in fault tolerant broadcast networks and noisy decision trees
- Palette-alternating tree codes
- Title not available (Why is that?)
- Interactive Coding for Interactive Proofs
- Noisy Interactive Quantum Communication
- Capacity of Interactive Communication over Erasure Channels and Channels with Feedback
- An improvement of the tree code construction
- Making asynchronous distributed computations robust to noise
- Reliable communication over highly connected noisy networks
- Efficient Probabilistically Checkable Debates
- Sparse MDS Matrices over Small Fields: A Proof of the GM-MDS Conjecture
- Linear tree codes and the problem of explicit constructions
- Communication and information complexity
- The work of Mark Braverman
- Interactive non-malleable codes
- Title not available (Why is that?)
- Authenticated adversarial routing
- List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise
- Worst-case asymmetric distributed function computation
- Efficient Error-Correcting Codes for Sliding Windows
- Title not available (Why is that?)
- Making Asynchronous Distributed Computations Robust to Channel Noise
- The Cost of Fault Tolerance in Multi-Party Communication Complexity
- Fast Interactive Coding against Adversarial Noise
- Title not available (Why is that?)
This page was built for publication: Coding for interactive communication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3129462)
