383,183 research outputs found
Interactive Channel Capacity Revisited
We provide the first capacity approaching coding schemes that robustly
simulate any interactive protocol over an adversarial channel that corrupts any
fraction of the transmitted symbols. Our coding schemes achieve a
communication rate of over any
adversarial channel. This can be improved to for
random, oblivious, and computationally bounded channels, or if parties have
shared randomness unknown to the channel.
Surprisingly, these rates exceed the interactive channel capacity bound
which [Kol and Raz; STOC'13] recently proved for random errors. We conjecture
and to be the optimal rates for their respective settings
and therefore to capture the interactive channel capacity for random and
adversarial errors.
In addition to being very communication efficient, our randomized coding
schemes have multiple other advantages. They are computationally efficient,
extremely natural, and significantly simpler than prior (non-capacity
approaching) schemes. In particular, our protocols do not employ any coding but
allow the original protocol to be performed as-is, interspersed only by short
exchanges of hash values. When hash values do not match, the parties backtrack.
Our approach is, as we feel, by far the simplest and most natural explanation
for why and how robust interactive communication in a noisy environment is
possible
Optimal Error Rates for Interactive Coding II: Efficiency and List Decoding
We study coding schemes for error correction in interactive communications.
Such interactive coding schemes simulate any -round interactive protocol
using rounds over an adversarial channel that corrupts up to
transmissions. Important performance measures for a coding scheme are its
maximum tolerable error rate , communication complexity , and
computational complexity.
We give the first coding scheme for the standard setting which performs
optimally in all three measures: Our randomized non-adaptive coding scheme has
a near-linear computational complexity and tolerates any error rate with a linear communication complexity. This improves over
prior results which each performed well in two of these measures.
We also give results for other settings of interest, namely, the first
computationally and communication efficient schemes that tolerate adaptively, if only one party is required to
decode, and if list decoding is allowed. These are the
optimal tolerable error rates for the respective settings. These coding schemes
also have near linear computational and communication complexity.
These results are obtained via two techniques: We give a general black-box
reduction which reduces unique decoding, in various settings, to list decoding.
We also show how to boost the computational and communication efficiency of any
list decoder to become near linear.Comment: preliminary versio
Energy Efficient Transmission over Space Shift Keying Modulated MIMO Channels
Energy-efficient communication using a class of spatial modulation (SM) that
encodes the source information entirely in the antenna indices is considered in
this paper. The energy-efficient modulation design is formulated as a convex
optimization problem, where minimum achievable average symbol power consumption
is derived with rate, performance, and hardware constraints. The theoretical
result bounds any modulation scheme of this class, and encompasses the existing
space shift keying (SSK), generalized SSK (GSSK), and Hamming code-aided SSK
(HSSK) schemes as special cases. The theoretical optimum is achieved by the
proposed practical energy-efficient HSSK (EE-HSSK) scheme that incorporates a
novel use of the Hamming code and Huffman code techniques in the alphabet and
bit-mapping designs. Experimental studies demonstrate that EE-HSSK
significantly outperforms existing schemes in achieving near-optimal energy
efficiency. An analytical exposition of key properties of the existing GSSK
(including SSK) modulation that motivates a fundamental consideration for the
proposed energy-efficient modulation design is also provided
Efficient long distance quantum communication
Despite the tremendous progress of quantum cryptography, efficient quantum
communication over long distances (>1000km) remains an outstanding challenge
due to fiber attenuation and operation errors accumulated over the entire
communication distance. Quantum repeaters, as a promising approach, can
overcome both photon loss and operation errors, and hence significantly speedup
the communication rate. Depending on the methods used to correct loss and
operation errors, all the proposed QR schemes can be classified into three
categories (generations). Here we present the first systematic comparison of
three generations of quantum repeaters by evaluating the cost of both temporal
and physical resources, and identify the optimized quantum repeater
architecture for a given set of experimental parameters. Our work provides a
roadmap for the experimental realizations of highly efficient quantum networks
over transcontinental distances.Comment: Sreraman Muralidharan and Linshu Li contributed equally to this wor
- …