Coding for interactive communication
From MaRDI portal
Publication:3129462
Recommendations
Cited in
(38)- Dimension reduction for finite trees in _1
- Dimension reduction for finite trees in \(\ell_1\)
- Computing in fault tolerant broadcast networks and noisy decision trees
- Palette-alternating tree codes
- scientific article; zbMATH DE number 7564410 (Why is no real title available?)
- Interactive Coding for Interactive Proofs
- Interactive information and coding theory
- An improvement of the tree code construction
- Fast interactive coding against adversarial noise
- Coding for interactive communication: a survey
- Towards optimal deterministic coding for interactive communication
- Making asynchronous distributed computations robust to noise
- Reliable communication over highly connected noisy networks
- A validation algorithm of the transmitter`s boundedly deterministic behaviour in a partial erasure channel
- Efficient Probabilistically Checkable Debates
- Capacity approaching coding for low noise interactive quantum communication
- Fast algorithms for interactive coding
- Simulating noisy channel interaction (extended abstract)
- Efficient error-correcting codes for sliding windows
- Noisy interactive quantum communication
- Linear tree codes and the problem of explicit constructions
- Coding for interactive communication correcting insertions and deletions
- Capacity of interactive communication over erasure channels and channels with feedback
- Interactive channel capacity
- Towards deterministic tree code constructions
- Communication and information complexity
- The work of Mark Braverman
- Authenticated adversarial routing
- Interactive non-malleable codes
- List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise
- Worst-case asymmetric distributed function computation
- Making polynomials robust to noise
- On decoding Cohen-Haeupler-Schulman tree codes
- scientific article; zbMATH DE number 6866311 (Why is no real title available?)
- The cost of fault tolerance in multi-party communication complexity
- Sparse MDS matrices over small fields: a proof of the GM-MDS conjecture
- Making Asynchronous Distributed Computations Robust to Channel Noise
- Interactive function computation via polar coding
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)