English
Related papers

Related papers: Information-Theoretic Foundations of Mismatched De…

200 papers

It is very difficult to solve the Maximum Mutual Information (MMI) or Maximum Likelihood (ML) for all possible Shannon Channels or uncertain rules of choosing hypotheses, so that we have to use iterative methods. According to the Semantic…

Information Theory · Computer Science 2017-06-27 Chenguang Lu

This paper studies the mismatched decoding problem for binary-input discrete memoryless channels. An example is provided for which an achievable rate based on superposition coding exceeds the LM rate (Hui, 1983; Csisz\'ar-K\"orner, 1981),…

Information Theory · Computer Science 2015-08-11 Jonathan Scarlett , Anelia Somekh-Baruch , Alfonso Martinez , Albert Guillén i Fàbregas

We study the problem of decoding classical information encoded on quantum states at the output of a quantum channel, with particular focus on increasing the communication rates towards the maximum allowed by Quantum Mechanics. After a brief…

Quantum Physics · Physics 2017-10-25 Matteo Rosati

Rate-distortion-perception theory generalizes Shannon's rate-distortion theory by introducing a constraint on the perceptual quality of the output. The perception constraint complements the conventional distortion constraint and aims to…

Information Theory · Computer Science 2022-04-14 Jun Chen , Lei Yu , Jia Wang , Wuxian Shi , Yiqun Ge , Wen Tong

The problem of mismatched decoding for discrete memoryless channels is addressed. A mismatched cognitive multiple-access channel is introduced, and an inner bound on its capacity region is derived using two alternative encoding methods:…

Information Theory · Computer Science 2013-05-03 Anelia Somekh-Baruch

Shannon's information theory deliberately excludes message semantics. This paper develops a rigorous framework for semantic communication that integrates formal proof systems with Shannon-theoretic tools. We introduce an axiomatic…

Logic in Computer Science · Computer Science 2026-04-21 Jianfeng Xu

The rising interest in applications requiring the transmission of small amounts of data has recently lead to the development of accurate performance bounds and of powerful channel codes for the transmission of short-data packets over the…

Information Theory · Computer Science 2017-05-17 Gianluigi Liva , Giuseppe Durisi , Marco Chiani , Shakeel Salamat Ullah , Soung Chang Liew

We investigate the fundamental limits of reliable communication over multi-view channels, in which the channel output is comprised of a large number of independent noisy views of a transmitted symbol. We consider first the setting of…

Information Theory · Computer Science 2024-05-14 V. Arvind Rameshwar , Nir Weinberger

Shannon's Capacity Theorem is the main concept behind the Theory of Communication. It says that if the amount of information contained in a signal is smaller than the channel capacity of a physical media of communication, it can be…

Chaotic Dynamics · Physics 2009-11-13 M. S. Baptista , J. Kurths

In quantum Shannon theory, the way information is encoded and decoded takes advantage of the laws of quantum mechanics, while the way communication channels are interlinked is assumed to be classical. In this Letter we relax the assumption…

Quantum Physics · Physics 2018-03-28 Daniel Ebler , Sina Salek , Giulio Chiribella

Traditional communication theory focuses on minimizing transmit power. However, communication links are increasingly operating at shorter ranges where transmit power can be significantly smaller than the power consumed in decoding. This…

Information Theory · Computer Science 2011-02-17 Pulkit Grover , Kristen Ann Woyach , Anant Sahai

One of the primary goals of information theory is to provide limits on the amount of information it is possible to send through various types of communication channels, and to understand the encoding methods that will allow one to achieve…

Quantum Physics · Physics 2014-08-07 Michael R. Beran , Scott M. Cohen

We study the setting of channel coding over a family of channels whose state is controlled by an adversarial jammer by viewing it as a zero-sum game between a finite blocklength encoder-decoder team, and the jammer. The encoder-decoder team…

Information Theory · Computer Science 2018-11-20 Sharu Theresa Jose , Ankur A. Kulkarni

In this article, we investigate strategic information transmission over a noisy channel. This problem has been widely investigated in Economics, when the communication channel is perfect. Unlike in Information Theory, both encoder and…

Information Theory · Computer Science 2018-07-16 Mael Le Treust , Tristan Tomala

We extend the notion of list decoding to {\em ratio list decoding} which involves a list decoder whose list size is specified as a function of the number of messages $M_n$ and the block length $n$. We present necessary and sufficient…

Information Theory · Computer Science 2018-10-19 Anelia Somekh-Baruch

The problem of state communication over a discrete memoryless channel with discrete memoryless state is studied when the state information is available strictly causally at the encoder. It is shown that block Markov encoding, in which the…

Information Theory · Computer Science 2015-03-20 Chiranjib Choudhuri , Young-Han Kim , Urbashi Mitra

We study the problem of efficient compression of a stochastic source of probability distributions. It can be viewed as a generalization of Shannon's source coding problem. It has relation to the theory of common randomness, as well as to…

Quantum Physics · Physics 2016-09-08 Andreas Winter

The generalization of Shannon's theory to include messages with given autocorrelations is presented. The analytical calculation of the channel capacity is based on the transfer matrix method of the effective 1D Hamiltonian. This bridge…

Statistical Mechanics · Physics 2007-05-23 Ido Kanter , Hanan Rosemarin

The common approach of designing a communication device is to maximize a well-defined objective function, e.g., the channel capacity and the cut-off rate. We propose easy-to-implement solutions for Gaussian channels that approximate the…

Information Theory · Computer Science 2016-03-24 Qian Yu

Spinal codes are a type of capacity-achieving rateless codes that have been proved to approach the Shannon capacity over the additive white Gaussian noise (AWGN) channel and the binary symmetric channel (BSC). In this paper, we aim to…

Information Theory · Computer Science 2022-04-05 Aimin Li , Shaohua Wu , Jian Jiao , Ning Zhang , Qinyu Zhang