On the public citation graph
Coding for Interactive Communication: A Survey
0 signed · 83 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/j.1538-7305.1948.tb00917.xopenalex-snapshot
A Mathematical Theory of Communication
inferredcites →https://doi.org/10.1002/j.1538-7305.1950.tb00463.xopenalex-snapshot
Error Detecting and Error Correcting Codes
inferredcites →https://doi.org/10.1002/j.1538-7305.1974.tb02751.xopenalex-snapshot
Codes Which Detect Deception
inferredcites →https://doi.org/10.1002/rsa.3240030308openalex-snapshot
Simple Constructions of Almost k‐wise Independent Random Variables
inferredcites →https://doi.org/10.1007/978-3-662-49099-0_13openalex-snapshot
Interactive Coding for Interactive Proofs
inferredcites →https://doi.org/10.1007/bf01200757openalex-snapshot
The geometry of graphs and some of its algorithmic applications
inferredcites →https://doi.org/10.1007/bf01215349openalex-snapshot
Packet routing and job-shop scheduling inO(congestion+dilation) steps
inferredcites →https://doi.org/10.1007/s00446-017-0303-5openalex-snapshot
Reliable Communication over Highly Connected Noisy Networks
inferredcites →https://doi.org/10.1016/j.ipl.2006.03.007openalex-snapshot
An improvement of the tree code construction
inferredcites →https://doi.org/10.1016/j.laa.2015.10.030openalex-snapshot
Linear tree codes and the problem of explicit constructions
inferredcites →https://doi.org/10.1103/physreva.56.1201openalex-snapshot
Substituting quantum entanglement for communication
inferredcites →https://doi.org/10.1103/physrevlett.70.1895openalex-snapshot
Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
inferredcites →https://doi.org/10.1109/18.2626openalex-snapshot
Finding parity in a simple broadcast network
inferredcites →https://doi.org/10.1109/18.556671openalex-snapshot
Coding for interactive communication
inferredcites →https://doi.org/10.1109/focs.2012.69openalex-snapshot
Formulas Resilient to Short-Circuit Errors
inferredcites →https://doi.org/10.1109/focs.2014.39openalex-snapshot
Noisy Interactive Quantum Communication
inferredcites →https://doi.org/10.1109/isit.2016.7541368openalex-snapshot
Adaptive protocols for interactive communication
inferredcites →https://doi.org/10.1109/tit.1956.1056798openalex-snapshot
The zero error capacity of a noisy channel
inferredcites →https://doi.org/10.1109/tit.1978.1055827openalex-snapshot
Bounds for binary codes of length less than 25
inferredcites →https://doi.org/10.1109/tit.2009.2021303openalex-snapshot
Error-Correcting Codes for Automatic Control
inferredcites →https://doi.org/10.1109/tit.2013.2294186openalex-snapshot
Efficient Coding for Interactive Communication
inferredcites →https://doi.org/10.1109/tit.2014.2353994openalex-snapshot
Toward Coding for Maximum Errors in Interactive Communication
inferredcites →https://doi.org/10.1109/tit.2014.2367094openalex-snapshot
Optimal Coding for Streaming Authentication and Interactive Communication
inferredcites →https://doi.org/10.1109/tit.2016.2582176openalex-snapshot
Maximal Noise in Interactive Communication Over Erasure Channels and Channels With Feedback
inferredcites →https://doi.org/10.1137/0218012openalex-snapshot
The Knowledge Complexity of Interactive Proof Systems
inferredcites →https://doi.org/10.1137/0222053openalex-snapshot
Small-Bias Probability Spaces: Efficient Constructions and Applications
inferredcites →https://doi.org/10.1137/0403021openalex-snapshot
Monotone Circuits for Connectivity Require Super-Logarithmic Depth
inferredcites →https://doi.org/10.1137/060654864openalex-snapshot
Lower Bounds for the Noisy Broadcast Problem
inferredcites →https://doi.org/10.1137/1.9781611974331.ch135openalex-snapshot
Towards Optimal Deterministic Coding for Interactive Communication
inferredcites →https://doi.org/10.1137/1.9781611974331.ch18openalex-snapshot
The Adversarial Noise Threshold for Distributed Protocols
inferredcites →https://doi.org/10.1145/167088.167279openalex-snapshot
Deterministic coding for interactive communication
inferredcites →https://doi.org/10.1145/195058.195462openalex-snapshot
A coding theorem for distributed computation
inferredcites →https://doi.org/10.1145/2554797.2554813openalex-snapshot
Tree codes and a conjecture on exponential sums
inferredcites →https://doi.org/10.1145/2661628openalex-snapshot
Fast Interactive Coding against Adversarial Noise
inferredcites →https://doi.org/10.1145/2688073.2688077openalex-snapshot
Maximal Noise in Interactive Communication over Erasure Channels and Channels with Feedback
inferredcites →https://doi.org/10.1145/2897518.2897563openalex-snapshot
Constant-Rate Coding for Multiparty Interactive Communication Is Impossible
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-319-98113-0_24openalex-snapshot
Secure Two-Party Computation over Unreliable Channels
inferred← citeshttps://doi.org/10.1007/s00446-018-0343-5openalex-snapshot
Making asynchronous distributed computations robust to noise
inferred← citeshttps://doi.org/10.1007/s00446-023-00452-2openalex-snapshot
Distributed computations in fully-defective networks
inferred← citeshttps://doi.org/10.1007/s00446-025-00491-xopenalex-snapshot
Content-oblivious leader election on rings
inferred← citeshttps://doi.org/10.1007/s00446-026-00517-yopenalex-snapshot
Non-uniform content-oblivious leader election in 2-edge-connected networks
inferred← citeshttps://doi.org/10.1109/focs.2017.30openalex-snapshot
Optimal Interactive Coding for Insertions, Deletions, and Substitutions
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00049openalex-snapshot
Deterministic and Efficient Interactive Coding from Hard-to-Decode Tree Codes
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00051openalex-snapshot
Binary Interactive Error Resilience Beyond
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00008openalex-snapshot
Binary Codes with Resilience Beyond 1/4 via Interaction
inferred← citeshttps://doi.org/10.1109/isit57864.2024.10619253openalex-snapshot
Computation in Server-Assisted Noisy Networks
inferred← citeshttps://doi.org/10.1109/isit57864.2024.10619345openalex-snapshot
Improved Bounds on the Interactive Capacity via Error Pattern Analysis
inferred← citeshttps://doi.org/10.1109/isit57864.2024.10619523openalex-snapshot
Information Exchange is Harder with Noise at Source
inferred← citeshttps://doi.org/10.1109/itw48936.2021.9611505openalex-snapshot
Multiparty Interactive Communication with Broadcast Links
inferred← citeshttps://doi.org/10.1109/jsait.2021.3126422openalex-snapshot
Multiparty Interactive Coding Over Networks of Intersecting Broadcast Links
inferred← citeshttps://doi.org/10.1109/tit.2018.2829764openalex-snapshot
Explicit Capacity Approaching Coding for Interactive Communication
inferred← citeshttps://doi.org/10.1109/tit.2019.2904576openalex-snapshot
Constant-Rate Interactive Coding Is Impossible, Even in Constant-Degree Networks
inferred← citeshttps://doi.org/10.1109/tit.2019.2916927openalex-snapshot
Optimal Interactive Coding for Insertions, Deletions, and Substitutions
inferred← citeshttps://doi.org/10.1109/tit.2021.3066009openalex-snapshot
Efficient Multiparty Interactive Coding—Part I: Oblivious Insertions, Deletions and Substitutions
inferred← citeshttps://doi.org/10.1109/tit.2021.3086221openalex-snapshot
Capacity Approaching Coding for Low Noise Interactive Quantum Communication Part I: Large Alphabets
inferred← citeshttps://doi.org/10.1109/tit.2022.3160515openalex-snapshot
Efficient Multiparty Interactive Coding—Part II: Non-Oblivious Noise
inferred← citeshttps://doi.org/10.1109/tit.2025.3545097openalex-snapshot
Binary Error-Correcting Codes With Minimal Noiseless Feedback
inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch137openalex-snapshot
Interactive Coding with Small Memory
inferred← citeshttps://doi.org/10.1137/18m1235703openalex-snapshot
Efficient Error-Correcting Codes for Sliding Windows
inferred← citeshttps://doi.org/10.1137/22m1520578openalex-snapshot
Circuits Resilient to Short-Circuit Errors
inferred← citeshttps://doi.org/10.1137/22m1537631openalex-snapshot
The Optimal Error Resilience of Interactive Communication over Binary Channels
inferred← citeshttps://doi.org/10.1145/3188745.3188908openalex-snapshot
Capacity approaching coding for low noise interactive quantum communication
inferred← citeshttps://doi.org/10.1145/3188745.3188928openalex-snapshot
Explicit binary tree codes with polylogarithmic size alphabet
inferred← citeshttps://doi.org/10.1145/3293611.3331621openalex-snapshot
Efficient Multiparty Interactive Coding for Insertions, Deletions, and Substitutions
inferred← citeshttps://doi.org/10.1145/3369740.3369771openalex-snapshot
A Scalable Algorithm for Multiparty Interactive Communication with Private Channels
inferred← citeshttps://doi.org/10.1145/3406325.3451077openalex-snapshot
Optimal error resilience of adaptive message exchange
inferred← citeshttps://doi.org/10.1145/3468265openalex-snapshot
Synchronization Strings: Codes for Insertions and Deletions Approaching the Singleton Bound
inferred← citeshttps://doi.org/10.1145/3519935.3519980openalex-snapshot
Interactive error correcting codes over binary erasure channels resilient to > ½ adversarial corruption
inferred← citeshttps://doi.org/10.1145/3519935.3519985openalex-snapshot
The optimal error resilience of interactive communication over binary channels
inferred← citeshttps://doi.org/10.1145/3519935.3520007openalex-snapshot
Circuits resilient to short-circuit errors
inferred← citeshttps://doi.org/10.1145/3519935.3520033openalex-snapshot
Explicit binary tree codes with sub-logarithmic size alphabet
inferred← citeshttps://doi.org/10.1145/3538390openalex-snapshot
Optimal Short-Circuit Resilient Formulas
inferred← citeshttps://doi.org/10.1145/3564246.3585126openalex-snapshot
Binary Error-Correcting Codes with Minimal Noiseless Feedback
inferred← citeshttps://doi.org/10.1145/3564246.3585162openalex-snapshot
Efficient Interactive Coding Achieving Optimal Error Resilience over the Binary Channel
inferred← citeshttps://doi.org/10.1145/3583668.3594578openalex-snapshot
Distributed CONGEST Algorithms against Mobile Adversaries
inferred← citeshttps://doi.org/10.1145/3662158.3662785openalex-snapshot
Brief Announcement: Content-Oblivious Leader Election on Rings
inferred← citeshttps://doi.org/10.3934/math.2026798openalex-snapshot
The Lovász local lemma: foundations and applications
inferred← citeshttps://doi.org/10.47941/jts.2145openalex-snapshot
Cybersecurity Threats and Mitigation Strategies in the Age of Quantum Computing
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.