English
Related papers

Related papers: Mismatch Capacity under Stochastic Decoding

200 papers

We study the secrecy capacity in the vicinity of colluding eavesdroppers. Contrary to the perfect collusion assumption in previous works, our new information-theoretic model considers constraints in collusion. We derive the achievable…

Information Theory · Computer Science 2013-12-12 Mahtab Mirmohseni , Panagiotis Papadimitratos

We study the discrete memoryless Z-interference channel (ZIC) where the transmitter of the pair that suffers from interference is cognitive. We first provide an upper bound on the capacity of this channel. We then show that, when the…

Information Theory · Computer Science 2012-02-16 Nan Liu , Ivana Maric , Yinghui Cheng , Andrea J. Goldsmith , Shlomo Shamai

This paper presents an analysis of the concept of capacity for noisy com- putations, i.e. functions implemented by unreliable or random devices. An information theoretic model of noisy computation of a perfect function f (measurable…

Information Theory · Computer Science 2016-03-23 Francois Simon

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

Consider communication over a channel whose probabilistic model is completely unknown vector-wise and is not assumed to be stationary. Communication over such channels is challenging because knowing the past does not indicate anything about…

Information Theory · Computer Science 2013-03-21 Yuval Lomnitz , Meir Feder

In this paper, a generalization of the traditional point-to-point to communication setup, which is named as "reliable communications with asymmetric codebooks", is proposed. Under the assumption of independent identically distributed…

Information Theory · Computer Science 2008-09-12 Yucel Altug , M. Kivanc Mihcak , Onur Ozyesil , Vishal Monga

This paper concerns non-overlapping codes, block codes motivated by synchronisation and DNA-based storage applications. Most existing constructions of these codes do not account for the restrictions posed by the physical properties of…

Information Theory · Computer Science 2025-02-05 Lidija Stanovnik , Miha Moškon , Miha Mraz

We prove a one-shot "minimax" converse bound for quantum channel coding assisted by positive partial transpose channels between sender and receiver. The bound is similar in spirit to the converse by Polyanskiy, Poor, and Verdu [IEEE Trans.…

Quantum Physics · Physics 2015-06-01 Joseph M. Renes

In this paper, first, we investigate the model of degraded broadcast channel with side information and confidential messages. This work is from Steinberg's work on the degraded broadcast channel with causal and noncausal side information,…

Information Theory · Computer Science 2016-11-17 Bin Dai , A. J. Han Vinck , Zhuojun Zhuang , Yuan Luo

Correlated scattering occurs naturally in frequency-selective fading channels and its impact on the performance needs to be understood. In particular, we answer the question whether the uncorrelated scattering model leads to an optimistic…

Information Theory · Computer Science 2009-01-19 Eduard Jorswieck , Martin Mittelbach

List decoding for arbitrarily varying channels (AVCs) under state constraints is investigated. It is shown that rates within $\epsilon$ of the randomized coding capacity of AVCs with input-dependent state can be achieved under maximal error…

Information Theory · Computer Science 2009-10-06 Anand D. Sarwate , Michael Gastpar

We establish the capacity of a class of communication channels introduced in [1]. The $n$-letter input from a finite alphabet is passed through a discrete memoryless channel $P_{Z|X}$ and then the output $n$-letter sequence is uniformly…

Information Theory · Computer Science 2023-10-30 Jennifer Tang , Yury Polyanskiy

This paper is motivated by the problem of error control in network coding when errors are introduced in a random fashion (rather than chosen by an adversary). An additive-multiplicative matrix channel is considered as a model for random…

Information Theory · Computer Science 2019-05-07 Danilo Silva , Frank R. Kschischang , Ralf Kötter

Gaussian loss channels are of particular importance since they model realistic optical communication channels. Except for special cases, quantum capacity of Gaussian loss channels is not yet known completely. In this paper, we provide…

Quantum Physics · Physics 2019-03-19 Kyungjoo Noh , Victor V. Albert , Liang Jiang

We consider a channel-independent decoder which is for i.i.d. random codes what the maximum mutual-information decoder is for constant composition codes. We show that this decoder results in exactly the same i.i.d. random coding error…

Information Theory · Computer Science 2018-11-06 Sergey Tridenski , Ram Zamir

Shannon's channel coding theorem describes the maximum possible rate of reliable information transfer through a classical noisy communication channel. It, together with the source coding theorem, characterizes lossless channel communication…

Quantum Physics · Physics 2021-05-17 Sristy Agrawal , Rajashik Tarafder , Graeme Smith , Arup Roy , Manik Banik

As conventional communication systems based on classic information theory have closely approached the limits of Shannon channel capacity, semantic communication has been recognized as a key enabling technology for the further improvement of…

Information Theory · Computer Science 2023-06-06 Jiancheng Tang , Qianqian Yang , Zhaoyang Zhang

In our previous paper [Phys. Rev. E 95, 062122 (2017)] we considered the optical channel modelled by the nonlinear Schr\"odinger equation with zero dispersion and additive Gaussian noise. We found per-sample channel capacity rof this model.…

Information Theory · Computer Science 2019-01-23 A. V. Reznichenko , A. I. Chernykh , S. V. Smirnov , I. S. Terekhov

"Independent and identically distributed" errors do not accurately capture the noisy behavior of real-world data storage and information transmission technologies. Motivated by this, we study channels with input-correlated synchronization…

Information Theory · Computer Science 2026-05-14 Roni Con , João Ribeiro

Let $W$ be a binary-input memoryless symmetric (BMS) channel with Shannon capacity $I(W)$ and fix any $\alpha > 0$. We construct, for any sufficiently small $\delta > 0$, binary linear codes of block length $O(1/\delta^{2+\alpha})$ and rate…

Information Theory · Computer Science 2022-01-25 Venkatesan Guruswami , Andrii Riazanov , Min Ye
‹ Prev 1 8 9 10 Next ›