Deterministic coding for interactive communication
From MaRDI portal
Publication:5248546
DOI10.1145/167088.167279zbMath1310.68074OpenAlexW2020278159MaRDI QIDQ5248546
Publication date: 7 May 2015
Published in: Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/167088.167279
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (15)
An improvement of the tree code construction ⋮ Interactive communication with unknown noise rate ⋮ Synchronization Strings: Channel Simulations and Interactive Coding for Insertions and Deletions ⋮ Interactive non-malleable codes ⋮ Distributed computations in fully-defective networks ⋮ Linear tree codes and the problem of explicit constructions ⋮ The work of Mark Braverman ⋮ Efficient Error-Correcting Codes for Sliding Windows ⋮ Reliable communication over highly connected noisy networks ⋮ Interactive Coding for Interactive Proofs ⋮ Capacity of Interactive Communication over Erasure Channels and Channels with Feedback ⋮ 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
This page was built for publication: Deterministic coding for interactive communication
