English
Related papers

Related papers: Capacity of Block-Memoryless Channels with Causal …

200 papers

The Finite Transmission Feedback Information (FTFI) capacity is characterized for any class of channel conditional distributions $\big\{{\bf P}_{B_i|B^{i-1}, A_i} :i=0, 1, \ldots, n\big\}$ and $\big\{ {\bf P}_{B_i|B_{i-M}^{i-1}, A_i} :i=0,…

Information Theory · Computer Science 2016-08-22 Christos K. Kourtellaris , Charalambos D. Charalambous

The capacity of a channel is known to be equivalent to the highest rate at which it can generate entanglement. Analogous to entanglement, the notion of a causality measure characterises the temporal aspect of quantum correlations. Despite…

Quantum Physics · Physics 2020-02-24 Robert Pisarczyk , Zhikuan Zhao , Yingkai Ouyang , Vlatko Vedral , Joseph F. Fitzsimons

For the class of the memoryless binary-input channels which are not necessarily symmetric, we derive tight bounds on the capacity in terms of the Bhattacharyya parameter. As it turns out, the bounds derived under the symmetric channel…

Information Theory · Computer Science 2017-10-31 Mustafa Kesal

In Shannon information theory the capacity of a memoryless communication channel cannot be increased by the use of feedback from receiver to sender. In this paper the use of classical feedback is shown to provide no increase in the…

Quantum Physics · Physics 2007-05-23 Garry Bowen , Rajagopal Nagarajan

We study communication with consensus over a broadcast channel - the receivers reliably decode the sender's message when the sender is honest, and their decoder outputs agree even if the sender acts maliciously. We characterize the…

Information Theory · Computer Science 2025-03-27 Neha Sangwan , Varun Narayanan , Vinod M. Prabhakaran

We propose an iterative method for approximately computing the capacity of discrete memoryless channels, possibly under additional constraints on the input distribution. Based on duality of convex programming, we derive explicit upper and…

Information Theory · Computer Science 2015-04-06 Tobias Sutter , David Sutter , Peyman Mohajerin Esfahani , John Lygeros

This work introduces capacity limits for molecular timing (MT) channels, where information is modulated on the release timing of small information particles, and decoded from the time of arrival at the receiver. It is shown that the random…

Information Theory · Computer Science 2016-11-15 Nariman Farsad , Yonathan Murin , Andrew Eckford , Andrea Goldsmith

We propose two coding schemes for the two-receiver discrete memoryless broadcast channel (BC) with rate-limited feedback from one or both receivers. They improve over the nofeedback capacity region for a large class of channels, including…

Information Theory · Computer Science 2016-02-19 Youlong Wu , Michèle Wigger

This paper studies a layered erasure interference channel model, which is a simplification of the Gaussian interference channel with fading using the deterministic model approach. In particular, the capacity region of the layered erasure…

Information Theory · Computer Science 2009-09-08 Yan Zhu , Dongning Guo

The cognitive interference channel is an interference channel in which one transmitter is non-causally provided with the message of the other transmitter. This channel model has been extensively studied in the past years and capacity…

Information Theory · Computer Science 2010-03-24 Stefano Rini , Daniela Tuninetti , Natasha Devroye

In diffusion-based molecular communications, messages can be conveyed via the variation in the concentration of molecules in the medium. In this paper, we intend to analyze the achievable capacity in transmission of information from one…

Information Theory · Computer Science 2011-05-11 Arash Einolghozati , Mohsen Sardari , Ahmad Beirami , Faramarz Fekri

This paper studies the capacity of molecular communications in fluid media, where the information is encoded in the number of transmitted molecules in a time-slot (amplitude shift keying). The propagation of molecules is governed by random…

Information Theory · Computer Science 2016-04-29 Siavash Ghavami , Raviraj Adve , Farshad Lahouti

Consider the broadcast relay channel (BRC) which consists of a source sending information over a two user broadcast channel in presence of two relay nodes that help the transmission to the destinations. Clearly, this network with five nodes…

Information Theory · Computer Science 2010-05-05 Arash Behboodi , Pablo Piantanida

Channel polarization is a method of constructing capacity achieving codes for symmetric binary-input discrete memoryless channels (B-DMCs) [1]. In the original paper, the construction complexity is exponential in the blocklength. In this…

Information Theory · Computer Science 2009-05-23 Ryuhei Mori , Toshiyuki Tanaka

We investigate if feedback can increase the capacity of an energy harvesting communication channel where a transmitter powered by an exogenous energy arrival process and equipped with a finite battery communicates to a receiver over a…

Information Theory · Computer Science 2015-06-08 Dor Shaviv , Ayfer Ozgur , Haim Permuter

Transmitting data reliably over noisy communication channels is one of the most important applications of information theory, and well understood when the channel is accurately modelled by classical physics. However, when quantum effects…

In this work, we obtain lower and upper bounds on the maximal transmission rate at a given codeword length $n$, average probability of error $\epsilon$ and power constraint $\bar{P}$, over a finite valued, block fading additive white…

Information Theory · Computer Science 2017-11-15 Deekshith P K , Vinod Sharma

We consider communication over a multiple-input single-output (MISO) block fading channel in the presence of an independent noiseless feedback link. We assume that the transmitter and receiver have no prior knowledge of the channel state…

Information Theory · Computer Science 2018-03-16 Jinyuan Chen

In this paper, we investigate the problem of communication over cognitive interference channel (CIC) with partially cooperating (PC) destinations (CIC-PC). This channel consists of two source nodes communicating two independent messages to…

Information Theory · Computer Science 2014-01-29 Mohammad Kazemi , Sahar Hashemgeloogerdi

A class of burst noise-erasure channels which incorporate both errors and erasures during transmission is studied. The channel, whose output is explicitly expressed in terms of its input and a stationary ergodic noise-erasure process, is…

Information Theory · Computer Science 2017-05-05 Lin Song , Fady Alajaji , Tamás Linder
‹ Prev 1 4 5 6 7 8 10 Next ›