5,879 research outputs found
Nash Codes for Noisy Channels
This paper studies the stability of communication protocols that deal with
transmission errors. We consider a coordination game between an informed sender
and an uninformed decision maker, the receiver, who communicate over a noisy
channel. The sender's strategy, called a code, maps states of nature to
signals. The receiver's best response is to decode the received channel output
as the state with highest expected receiver payoff. Given this decoding, an
equilibrium or "Nash code" results if the sender encodes every state as
prescribed. We show two theorems that give sufficient conditions for Nash
codes. First, a receiver-optimal code defines a Nash code. A second, more
surprising observation holds for communication over a binary channel which is
used independently a number of times, a basic model of information
transmission: Under a minimal "monotonicity" requirement for breaking ties when
decoding, which holds generically, EVERY code is a Nash code.Comment: More general main Theorem 6.5 with better proof. New examples and
introductio
Quadratic Multi-Dimensional Signaling Games and Affine Equilibria
This paper studies the decentralized quadratic cheap talk and signaling game
problems when an encoder and a decoder, viewed as two decision makers, have
misaligned objective functions. The main contributions of this study are the
extension of Crawford and Sobel's cheap talk formulation to multi-dimensional
sources and to noisy channel setups. We consider both (simultaneous) Nash
equilibria and (sequential) Stackelberg equilibria. We show that for arbitrary
scalar sources, in the presence of misalignment, the quantized nature of all
equilibrium policies holds for Nash equilibria in the sense that all Nash
equilibria are equivalent to those achieved by quantized encoder policies. On
the other hand, all Stackelberg equilibria policies are fully informative. For
multi-dimensional setups, unlike the scalar case, Nash equilibrium policies may
be of non-quantized nature, and even linear. In the noisy setup, a Gaussian
source is to be transmitted over an additive Gaussian channel. The goals of the
encoder and the decoder are misaligned by a bias term and encoder's cost also
includes a penalty term on signal power. Conditions for the existence of affine
Nash equilibria as well as general informative equilibria are presented. For
the noisy setup, the only Stackelberg equilibrium is the linear equilibrium
when the variables are scalar. Our findings provide further conditions on when
affine policies may be optimal in decentralized multi-criteria control problems
and lead to conditions for the presence of active information transmission in
strategic environments.Comment: 15 pages, 4 figure
Trusted Noise in Continuous-Variable Quantum Key Distribution: a Threat and a Defense
We address the role of the phase-insensitive trusted preparation and
detection noise in the security of a continuous-variable quantum key
distribution, considering the Gaussian protocols on the basis of coherent and
squeezed states and studying them in the conditions of Gaussian lossy and noisy
channels. The influence of such a noise on the security of Gaussian quantum
cryptography can be crucial, even despite the fact that a noise is trusted, due
to a strongly nonlinear behavior of the quantum entropies involved in the
security analysis. We recapitulate the known effect of the preparation noise in
both direct and reverse-reconciliation protocols, as well as the detection
noise in the reverse-reconciliation scenario. As a new result, we show the
negative role of the trusted detection noise in the direct-reconciliation
scheme. We also describe the role of the trusted preparation or detection noise
added at the reference side of the protocols in improving the robustness of the
protocols to the channel noise, confirming the positive effect for the
coherent-state reverse-reconciliation protocol. Finally, we address the
combined effect of trusted noise added both in the source and the detector.Comment: 25 pages, 9 figure
Quantum cryptography: key distribution and beyond
Uniquely among the sciences, quantum cryptography has driven both
foundational research as well as practical real-life applications. We review
the progress of quantum cryptography in the last decade, covering quantum key
distribution and other applications.Comment: It's a review on quantum cryptography and it is not restricted to QK
Network Code Design for Orthogonal Two-hop Network with Broadcasting Relay: A Joint Source-Channel-Network Coding Approach
This paper addresses network code design for robust transmission of sources
over an orthogonal two-hop wireless network with a broadcasting relay. The
network consists of multiple sources and destinations in which each
destination, benefiting the relay signal, intends to decode a subset of the
sources. Two special instances of this network are orthogonal broadcast relay
channel and the orthogonal multiple access relay channel. The focus is on
complexity constrained scenarios, e.g., for wireless sensor networks, where
channel coding is practically imperfect. Taking a source-channel and network
coding approach, we design the network code (mapping) at the relay such that
the average reconstruction distortion at the destinations is minimized. To this
end, by decomposing the distortion into its components, an efficient design
algorithm is proposed. The resulting network code is nonlinear and
substantially outperforms the best performing linear network code. A motivating
formulation of a family of structured nonlinear network codes is also
presented. Numerical results and comparison with linear network coding at the
relay and the corresponding distortion-power bound demonstrate the
effectiveness of the proposed schemes and a promising research direction.Comment: 27 pages, 9 figures, Submited to IEEE Transaction on Communicatio
Topological Subsystem Codes
We introduce a family of 2D topological subsystem quantum error-correcting
codes. The gauge group is generated by 2-local Pauli operators, so that 2-local
measurements are enough to recover the error syndrome. We study the
computational power of code deformation in these codes, and show that
boundaries cannot be introduced in the usual way. In addition, we give a
general mapping connecting suitable classical statistical mechanical models to
optimal error correction in subsystem stabilizer codes that suffer from
depolarizing noise.Comment: 16 pages, 11 figures, explanations added, typos correcte
- …