English
Related papers

Related papers: Capacity Definitions for General Channels with Rec…

200 papers

In this letter, we introduce the computational-limited (comp-limited) signals, a communication capacity regime in which the signal time computational complexity overhead is the key constraint -- rather than power or bandwidth -- to the…

Information Theory · Computer Science 2024-10-28 Saulo Queiroz , João P. Vilela , Edmundo Monteiro

An information measure based on fractional partitions of a set is used to derive a general dependence balance inequality for communication. This inequality is used to obtain new upper bounds on reliable and secret rates for multiterminal…

Information Theory · Computer Science 2026-04-14 Amin Gohari , Gerhard Kramer

We derive a lower bound on the secrecy capacity of the compound wiretap channel with channel state information at the transmitter which matches the general upper bound on the secrecy capacity of general compound wiretap channels given by…

Information Theory · Computer Science 2011-08-10 Igor Bjelaković , Holger Boche , Jochen Sommerfeld

The achievable information rate of finite-state input two-dimensional (2-D) channels with memory is an open problem, which is relevant, e.g., for inter-symbol-interference (ISI) channels and cellular multiple-access channels. We propose a…

Information Theory · Computer Science 2007-07-13 Ori Shental , Noam Shental , Shlomo Shamai

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

The channel capacity theorem for additive white Gaussian noise channel (AWGN), widely known as the Shannon-Hartley Law, expresses the information capacity of a channel bandlimited in the conventional Fourier domain in terms of the…

Information Theory · Computer Science 2009-01-29 Kamalesh Kumar Sharma

This paper addresses an interference channel consisting of $\mathbf{n}$ active users sharing $u$ frequency sub-bands. Users are asynchronous meaning there exists a mutual delay between their transmitted codes. A stationary model for…

Information Theory · Computer Science 2010-06-17 Kamyar Moshksar , Amir K. Khandani

The capacity of the two-user Gaussian cognitive interference channel, a variation of the classical interference channel where one of the transmitters has knowledge of both messages, is known in several parameter regimes but remains unknown…

Information Theory · Computer Science 2010-07-12 Stefano Rini , Daniela Tuninetti , Natasha Devroye

Which communication rates can be attained over a channel whose output is an unknown (possibly stochastic) function of the input that may vary arbitrarily in time with no a-priori model? Following the spirit of the finite-state…

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

Inner and outer bounds are established on the capacity region of two-sender, two-receiver interference channels where one transmitter knows both messages. The transmitter with extra knowledge is referred to as being cognitive. The inner…

Information Theory · Computer Science 2007-10-22 I. Maric , A. Goldsmith , G. Kramer , S. Shamai

The quantum capacity of a memoryless channel is often used as a single figure of merit to characterize its ability to transmit quantum information coherently. The capacity determines the maximal rate at which we can code reliably over…

Quantum Physics · Physics 2016-05-10 Marco Tomamichel , Mario Berta , Joseph M. Renes

Memoryless channels with synchronization errors as defined by a stochastic channel matrix allowing for symbol insertions and deletions in addition to random errors are considered. Such channels are information stable, hence their Shannon…

Information Theory · Computer Science 2011-03-01 Tolga M Duman

This paper considers a three-receiver broadcast channel with degraded message sets and message cognition. The model consists of a common message for all three receivers, a private common message for only two receivers and two additional…

Information Theory · Computer Science 2016-01-27 Ahmed S. Mansour , Rafael F. Schaefer , Holger Boche

In this paper, the fundamental limits on the rates at which information and energy can be simultaneously transmitted over an additive white Gaussian noise channel are studied under the following assumptions: $(a)$ the channel is memoryless;…

Information Theory · Computer Science 2021-10-06 Sadaf ul Zuhra , Samir M. Perlaza , Eitan Altman

We consider the discrete, time-varying broadcast channel with memory under the assumption that the channel states belong to a set of finite cardinality. We first define the physically degraded finite-state broadcast channel for which we…

Information Theory · Computer Science 2008-03-12 Ron Dabora , Andrea Goldsmith

This paper addresses an interference channel consisting of $\mathbf{n}$ active users sharing $u$ frequency sub-bands. Users are asynchronous meaning there exists a mutual delay between their transmitted codes. A stationary model for…

Information Theory · Computer Science 2010-06-17 Kamyar Moshksar , Amir K. Khandani

This paper investigates the information-theoretic limits of energy-harvesting (EH) channels in the finite blocklength regime. The EH process is characterized by a sequence of i.i.d. random variables with finite variances. We use the…

Information Theory · Computer Science 2016-10-19 Silas L. Fong , Vincent Y. F. Tan , Jing Yang

Although extensively investigated, the capacity of the two-hop half-duplex (HD) relay channel is not fully understood. In particular, a capacity expression which can be easily evaluated is not available and an explicit coding scheme which…

Information Theory · Computer Science 2015-11-18 Nikola Zlatanov , Vahid Jamali , Derrick Wing Kwan Ng , Robert

The cognitive interference channel models cognitive overlay radio systems, where cognitive radios overhear the transmission of neighboring nodes. Capacity for this channel is not known in general. For the Gaussian case capacity is known in…

Information Theory · Computer Science 2012-04-11 Stefano Rini , Ernest Kurniawan , Andrea Goldsmith

The readout of a classical memory can be modelled as a problem of quantum channel discrimination, where a decoder retrieves information by distinguishing the different quantum channels encoded in each cell of the memory [S. Pirandola, Phys.…