English
Related papers

Related papers: Gelfand-Pinsker coding achieves the interference-f…

200 papers

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

In this work we study the capacity of interference-limited channels with memory. These channels model non-orthogonal communications scenarios, such as the non-orthogonal multiple access (NOMA) scenario and underlay cognitive communications,…

Information Theory · Computer Science 2023-06-02 Ron Dabora , Emeka Abakasanga

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

We show that the amount of coherent quantum information that can be reliably transmitted down a dephasing channel with memory is maximized by separable input states. In particular, we model the channel as a Markov chain or a multimode…

Quantum Physics · Physics 2007-09-09 Antonio D'Arrigo , Giuliano Benenti , Giuseppe Falci

We consider the problem of optimal probing of states of a channel by transmitter and receiver for maximizing rate of reliable communication. The channel is discrete memoryless (DMC) with i.i.d. states. The encoder takes probing actions…

Information Theory · Computer Science 2016-11-15 Himanshu Asnani , Haim Permuter , Tsachy Weissman

We consider finite state channels (FSCs) with feedback and state information known causally at the encoder. This setting is quite general and includes: a memoryless channel with i.i.d. state (the Shannon strategy), Markovian states that…

Information Theory · Computer Science 2022-12-27 Eli Shemuel , Oron Sabag , Haim H. Permuter

This paper considers the problem of channel coding over Gaussian intersymbol interference (ISI) channels with a given metric decoding rule. Specifically, it is assumed that the mismatched decoder has an incorrect assumption on the impulse…

Information Theory · Computer Science 2017-06-20 Wasim Huleihel , Salman Salamatian , Neri Merhav , Muriel Médard

Strong secrecy communication over a discrete memoryless state-dependent multiple access channel (SD-MAC) with an external eavesdropper is investigated. The channel is governed by discrete memoryless and i.i.d. channel states and the channel…

Information Theory · Computer Science 2023-06-27 Yiqi Chen , Tobias Oechtering , Mikael Skoglund , Yuan Luo

Unequal transition probabilities between input and output symbols, input power constraints, or input symbols of unequal durations can lead to non-uniform capacity achieving input distributions for communication channels. Using uniform input…

Information Theory · Computer Science 2011-06-13 Georg Böcherer , Rudolf Mathar

We analyze the gains of opportunistic communication in multiuser interference channels. Consider a fully connected $n$-user Gaussian interference channel. At each time instance only $K\leq n$ transmitters are allowed to be communicating…

Information Theory · Computer Science 2010-07-22 Ali Tajer , Xiaodong Wang

In this paper, we focus on the two-user Gaussian interference channel (GIC), and study the Han-Kobayashi (HK) coding/decoding strategy with the objective of designing low-density parity-check (LDPC) codes. A code optimization algorithm is…

Information Theory · Computer Science 2014-05-27 Shahrouz Sharifi , A. Korhan Tanc , Tolga M. Duman

In this paper, we study the system-level advantages provided by rateless coding, early termination and power allocation strategy for multiple users distributed across multiple cells. In a multi-cell scenario, the early termination of coded…

Information Theory · Computer Science 2024-10-21 Yuan Li , Zicheng Ye , Huazi Zhang , Jun Wang , Jianglei Ma , Wen Tong

Many storage channels admit reading and rewriting of the content at a given cost. We consider rewritable channels with a hidden state which models the unknown characteristics of the memory cell. In addition to mitigating the effect of the…

Information Theory · Computer Science 2014-04-30 Ramji Venkataramanan , Sekhar Tatikonda , Luis Lastras , Michele Franceschini

We study the capacity region of the two-user Binary Fading (or Erasure) Interference Channel where the transmitters have no knowledge of the channel state information. We develop new inner-bounds and outer-bounds for this problem. We…

Information Theory · Computer Science 2017-03-28 Alireza Vahid , Mohammad Ali Maddah-Ali , Amir Salman Avestimehr , Yan Zhu

In this paper, we propose a low-complexity, secrecy capacity achieving polar coding scheme for the cognitive interference channel with confidential messages (CICC) under the strong secrecy criterion. Existing polar coding schemes for…

Information Theory · Computer Science 2017-10-30 Mengfan Zheng , Wen Chen , Cong Ling

We study the problem of coding over a general discrete memoryless broadcast channel controlled by random parameters. The parameters are available at the transmitter in a non-causal manner and are subject to a state masking constraint on the…

Information Theory · Computer Science 2018-10-30 Michael Dikshtein , Shlomo Shamai

A highly entangled bipartite quantum state is more advantageous for the quantum dense coding protocol than states with low entanglement. Such a correspondence, however, does not exist even for pure quantum states in the multipartite domain.…

Quantum Physics · Physics 2014-08-26 Tamoghna Das , R. Prabhu , Aditi Sen De , Ujjwal Sen

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

The sum-capacity for specific sub-classes of ergodic fading Gaussian two-user interference channels (IFCs) is developed under the assumption of perfect channel state information at all transmitters and receivers. For the sub-classes of…

Information Theory · Computer Science 2016-11-17 Lalitha Sankar , Xiaohu Shang , Elza Erkip , H. Vincent Poor

We show that the Extrinsic Information about the coded bits of any good (capacity achieving) code operating over a wide class of discrete memoryless channels (DMC) is zero when channel capacity is below the code rate and positive constant…

Information Theory · Computer Science 2007-07-13 Michael Peleg , Amichai Sanderovich , Shlomo Shamai