Codes for Adversaries: Between Worst-Case and Average-Case Jamming
Over the last 70 years, information theory and coding has enabled communication
technologies that have had an astounding impact on our lives. This is possible due to the …
technologies that have had an astounding impact on our lives. This is possible due to the …
Binary codes with resilience beyond 1/4 via interaction
K Efremenko, G Kol, RR Saxena… - 2022 IEEE 63rd Annual …, 2022 - ieeexplore.ieee.org
In the reliable transmission problem, a sender, Alice, wishes to transmit a bit-string x to a
remote receiver, Bob, over a binary channel with adversarial noise. The solution to this …
remote receiver, Bob, over a binary channel with adversarial noise. The solution to this …
Interactive error correcting codes over binary erasure channels resilient to> ½ adversarial corruption
An error correcting code (ECC) allows a sender to send a message to a receiver such that
even if a constant fraction of the communicated bits are corrupted, the receiver can still learn …
even if a constant fraction of the communicated bits are corrupted, the receiver can still learn …
The Capacity of Channels with O (1)-Bit Feedback
We consider point-to-point communication with partial noiseless feedback in which the
number of feedback bits is O(1) in the number of transmitted symbols. For q≧2, we study the …
number of feedback bits is O(1) in the number of transmitted symbols. For q≧2, we study the …
On the capacity of additive AVCs with feedback
We consider the problem of communication over adversarial channels with feedback. Two
parties comprising sender Alice and receiver Bob seek to communicate reliably. An …
parties comprising sender Alice and receiver Bob seek to communicate reliably. An …
A new upper bound on the maximal error resilience of interactive error-correcting codes
M Gupta, RY Zhang - arXiv preprint arXiv:2305.04376, 2023 - arxiv.org
In an interactive error-correcting code (iECC), Alice and Bob engage in an interactive
protocol with the goal of Alice communicating a message $ x\in\{0, 1\}^ k $ to Bob in such a …
protocol with the goal of Alice communicating a message $ x\in\{0, 1\}^ k $ to Bob in such a …
Correcting one error in non-binary channels with feedback
I Vorobyev, V Lebedev… - 2023 IEEE International …, 2023 - ieeexplore.ieee.org
In this paper, the problem of correction of a single error in q-ary symmetric channel with
noiseless feedback is considered. We propose an algorithm to construct codes with …
noiseless feedback is considered. We propose an algorithm to construct codes with …
Coding with noiseless feedback
VS Lebedev - Problems of Information Transmission, 2016 - Springer
Coding with Noiseless Feedback1 Page 1 ISSN 0032-9460, Problems of Information
Transmission, 2016, Vol. 52, No. 2, pp. 103–113. c Pleiades Publishing, Inc., 2016. Original …
Transmission, 2016, Vol. 52, No. 2, pp. 103–113. c Pleiades Publishing, Inc., 2016. Original …
Bounds for the capacity error function for unidirectional channels with noiseless feedback
C Deppe, V Lebedev, G Maringer - Theoretical Computer Science, 2021 - Elsevier
In digital systems such as fiber optical communications, the ratio between probability of
errors of type 1→ 0 and 0→ 1 can be large. Practically, one can assume that only one type of …
errors of type 1→ 0 and 0→ 1 can be large. Practically, one can assume that only one type of …
Two batch search with lie cost
R Ahlswede, F Cicalese, C Deppe… - IEEE transactions on …, 2009 - ieeexplore.ieee.org
We consider the problem of searching for an unknown number in the search space U={0,...,
M-1}. q-ary questions can be asked and some of the answers may be wrong. An arbitrary …
M-1}. q-ary questions can be asked and some of the answers may be wrong. An arbitrary …