English
Related papers

Related papers: Feedback capacity and coding for the BIBO channel …

200 papers

Calculating the capacity (with or without feedback) of channels with memory and continuous alphabets is a challenging task. It requires optimizing the directed information (DI) rate over all channel input distributions. The objective is a…

Information Theory · Computer Science 2020-05-19 Ziv Aharoni , Dor Tsur , Ziv Goldfeld , Haim Henry Permuter

In this paper we propose a feedback scheme for transmitting secret messages between two legitimate parties, over an eavesdropped communication link. Relative to Wyner's traditional encoding scheme \cite{wyner1}, our feedback-based encoding…

Information Theory · Computer Science 2009-09-29 George Amariucai , Shuangqing Wei

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

In this paper, we use a linear programming (LP) optimization approach to evaluate the equivocation for a wiretap channel where the main channel is noiseless, and the wiretap channel is a binary symmetric channel (BSC). Using this technique,…

Information Theory · Computer Science 2024-01-17 Ali Nikkhah , Morteza Shoushtari , Bahareh Akhbari , Willie K. Harrison

Variable length communication over a compound channel with feedback is considered. Traditionally, capacity of a compound channel without feedback is defined as the maximum rate that is determined before the start of communication such that…

Information Theory · Computer Science 2011-06-30 Aditya Mahajan , Sekhar Tatikonda

In this paper, we consider a multiple-input multiple-output broadcast channel with limited feedback where all users share the feedback rates. Firstly, we find the optimal feedback rate sharing strategy using zero-forcing transmission scheme…

Information Theory · Computer Science 2013-09-30 Jung Hoon Lee , Wan Choi

We consider a new formulation of a class of synchronization error channels and derive analytical bounds and numerical estimates for the capacity of these channels. For the binary channel with only deletions, we obtain an expression for the…

Information Theory · Computer Science 2016-11-17 Aravind R. Iyengar , Paul H. Siegel , Jack K. Wolf

It has been known for a long time that the mutual information between the input sequence and output of a binary symmetric channel (BSC) is upper bounded by the mutual information between the same input sequence and the output of a binary…

Information Theory · Computer Science 2024-01-29 Uri Erez , Or Ordentlich , Shlomo Shamai

In multi-terminal networks, feedback increases the capacity region and helps communication devices to coordinate. In this article, we deepen the relationship between coordination and feedback by considering a point-to-point scenario with an…

Information Theory · Computer Science 2016-11-15 Maël Le Treust

The capacity of unifilar finite-state channels in the presence of feedback is investigated. We derive a new evaluation method to extract graph-based encoders with their achievable rates, and to compute upper bounds to examine their…

Information Theory · Computer Science 2019-07-19 Oron Sabag , Bashar Huleihel , Haim Permuter

We develop practical coding schemes for the cognitive overlay radios as modeled by the cognitive interference channel, a variation of the classical two user interference channel where one of the transmitters has knowledge of both messages.…

Information Theory · Computer Science 2012-06-12 Ernest Kurniawan , Andrea Goldsmith , Stefano Rini

Recently, the authors showed that Reed-Muller (RM) codes achieve capacity on binary memoryless symmetric (BMS) channels with respect to bit error rate. This paper extends that work by showing that RM codes defined on non-binary fields,…

Information Theory · Computer Science 2023-05-16 Galen Reeves , Henry D. Pfister

This paper considers the scenario in which a set of nodes share a common channel. Some nodes have a rechargeable battery and the others are plugged to a reliable power supply and, thus, have no energy limitations. We consider two…

Information Theory · Computer Science 2011-08-02 Nikolaos Pappas , Jeongho Jeon , Anthony Ephremides , Apostolos Traganitis

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

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

We study the binomial channel and the structure of its capacity-achieving input and output distributions. It is known that the capacity-achieving input distribution is discrete and supported on finitely many points. The best previously…

Information Theory · Computer Science 2026-05-13 Mohammadamin Baniasadi , Luca Barletta , Alex Dytso

This paper investigates the first- and second-order maximum achievable rates of codes with/without cost constraints for mixed {channels} whose channel law is characterized by a general mixture of (at most) uncountably many stationary and…

Information Theory · Computer Science 2016-05-09 Hideki Yagi , Te Sun Han , Ryo Nomura

In this paper, we propose a new coding scheme for symmetric Gaussian interference channels with feedback based on the ideas of time-varying coding schemes. The proposed scheme improves the Suh-Tse and Kramer inner bounds of the channel…

Information Theory · Computer Science 2016-11-17 Lan V. Truong , Hirosuke Yamamoto

The capacity region of the N-sender Gaussian multiple access channel with feedback is not known in general. This paper studies the class of linear-feedback codes that includes (nonlinear) nonfeedback codes at one extreme and the…

Information Theory · Computer Science 2011-06-06 Ehsan Ardestanizadeh , Michele A. Wigger , Young-Han Kim , Tara Javidi

Next generation wireless communications rely on multiple input multiple output (MIMO) techniques to achieve high data rates. Feedback of channel information can be used in MIMO precoding to fully activate the strongest channel modes and…

Information Theory · Computer Science 2010-08-19 C. Jiang , M. Wang , C. Yang