Coding for interactive communication

DOI10.1109/18.556671zbMath0873.94007OpenAlexW2115551261MaRDI QIDQ3129462

Leonard J. Schulman

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

zbMATH Keywords

distributed computingtree codeerror correctioncoding theoremreliable communicationinteractive communication

Mathematics Subject Classification ID

Communication theory (94A05) Coding theorems (Shannon theory) (94A24) Source coding (94A29)

Related Items (26)

An improvement of the tree code construction ⋮ The Cost of Fault Tolerance in Multi-Party Communication Complexity ⋮ Worst-case asymmetric distributed function computation ⋮ Interactive non-malleable codes ⋮ Dimension reduction for finite trees in \(\ell_1\) ⋮ Linear tree codes and the problem of explicit constructions ⋮ The work of Mark Braverman ⋮ Communication and information complexity ⋮ List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise ⋮ Making Asynchronous Distributed Computations Robust to Channel Noise ⋮ Authenticated adversarial routing ⋮ Efficient Error-Correcting Codes for Sliding Windows ⋮ Making asynchronous distributed computations robust to noise ⋮ Reliable communication over highly connected noisy networks ⋮ Computing in fault tolerant broadcast networks and noisy decision trees ⋮ Unnamed Item ⋮ Interactive Coding for Interactive Proofs ⋮ Efficient Probabilistically Checkable Debates ⋮ Capacity of Interactive Communication over Erasure Channels and Channels with Feedback ⋮ Unnamed Item ⋮ Palette-alternating tree codes ⋮ Noisy Interactive Quantum Communication ⋮ Fast Interactive Coding against Adversarial Noise ⋮ Sparse MDS Matrices over Small Fields: A Proof of the GM-MDS Conjecture ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: Coding for interactive communication