English
Related papers

Related papers: Correcting one error in channels with feedback

200 papers

A simple feedback control algorithm is presented for distributed beamforming in a wireless network. A network of wireless sensors that seek to cooperatively transmit a common message signal to a Base Station (BS) is considered. In this…

Information Theory · Computer Science 2007-07-16 R. Mudumbai , J. Hespanha , U. Madhow , G. Barriac

As our main result we show that, in order to achieve the randomness assisted message - and entanglement transmission capacities of a finite arbitrarily varying quantum channel it is not necessary that sender and receiver share…

Quantum Physics · Physics 2015-06-12 Holger Boche , Janis Noetzel

Consider the asymmetric broadcast channel with a random superposition codebook, which may be comprised of constant composition or \iid codewords. By applying Forney's optimal decoder for individual messages and the message pair for the…

Information Theory · Computer Science 2019-06-10 Daming Cao , Vincent Y. F. Tan

A multiple antenna downlink channel where limited channel feedback is available to the transmitter is considered. In a vector downlink channel (single antenna at each receiver), the transmit antenna array can be used to transmit separate…

Information Theory · Computer Science 2016-11-17 Nihar Jindal

We study the power-versus-distortion trade-off for the transmission of a memoryless bivariate Gaussian source over a two-to-one Gaussian multiple-access channel with perfect causal feedback. In this problem, each of two separate…

Information Theory · Computer Science 2009-03-23 Amos Lapidoth , Stephan Tinguely

Contention resolution addresses the problem of coordinating access to a shared channel. Time proceeds in slots, and a packet transmission can be made in any slot. A packet is successfully sent if no other packet is also transmitted during…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-07-28 Michael A. Bender , Jeremy T. Fineman , Seth Gilbert , John Kuszmaul , Maxwell Young

In this paper, the problem of opportunistic channel sensing and access in cognitive radio networks when the sensing is imperfect and a secondary user has limited traffic to send at a time is investigated. Primary users' statistical…

Information Theory · Computer Science 2012-01-23 Zhou Zhang , Hai Jiang , Peng Tan , Jim Slevinsky

Making judicious channel access and transmission scheduling decisions is essential for improving performance as well as energy and spectral efficiency in multichannel wireless systems. This problem has been a subject of extensive study in…

Machine Learning · Computer Science 2015-04-07 Yang Liu , Mingyan Liu

Shannon's theory of zero-error communication is re-examined in the broader setting of using one classical channel to simulate another exactly, and in the presence of various resources that are all classes of non-signalling correlations:…

Quantum Physics · Physics 2016-11-17 Toby S. Cubitt , Debbie Leung , William Matthews , Andreas Winter

This work considers the problem of mitigating information leakage between communication and sensing in systems jointly performing both operations. Specifically, a discrete memoryless state-dependent broadcast channel model is studied in…

Information Theory · Computer Science 2023-03-22 Onur Günlü , Matthieu R. Bloch , Rafael F. Schaefer , Aylin Yener

One of the main figures of merit for quantum memories and quantum communication devices is their quantum capacity. It has been studied for arbitrary kinds of quantum channels, but its practical estimation has so far been limited to devices…

Quantum Physics · Physics 2018-05-16 Corsin Pfister , M. Adriaan Rol , Atul Mantri , Marco Tomamichel , Stephanie Wehner

We investigate whether the use of a noiseless, classical feedback channel will increase the capacity of a quantum discrete memoryless channel to transmit classical information. This problem has been previously analyzed by Bowen and…

Quantum Physics · Physics 2007-05-23 Andrew Skeen

We study a class of finite-state channels, known as POST channels, in which the previous channel output serves as the current state. A POST channel is deemed approximately memoryless when the state-dependent transition matrices are…

Information Theory · Computer Science 2026-03-11 Xiaojing Zhang , Jun Chen , Guanghui Wang

It is a well-known fact that feedback does not increase the capacity of point-to-point memoryless channels, however, its effect in secure communications is not fully understood yet. In this work, an achievable scheme for the wiretap channel…

Information Theory · Computer Science 2019-03-26 Germán Bassi , Pablo Piantanida , Shlomo Shamai

This paper considers rateless network error correction codes for reliable multicast in the presence of adversarial errors. Most existing network error correction codes are designed for a given network capacity and maximum number of errors…

Information Theory · Computer Science 2013-01-15 Wentao Huang , Tracey Ho , Hongyi Yao , Sidharth Jaggi

We propose efficient coding schemes for two communication settings: 1. asymmetric channels, and 2. channels with an informed encoder. These settings are important in non-volatile memories, as well as optical and broadcast communication. The…

Information Theory · Computer Science 2015-12-31 Eyal En Gad , Yue Li , Joerg Kliewer , Michael Langberg , Anxiao Jiang , Jehoshua Bruck

We study reliable communication over finite-state channels (FSCs) using Reed--Muller (RM) codes. Building on recent symmetry-based analyses for memoryless channels, we show that a sequence of binary RM codes (with some random scrambling)…

Information Theory · Computer Science 2026-04-17 Henry D. Pfister , Navin Kashyap , Jean-Francois Chamberland , Galen Reeves

We firstly extend the interpretation of feedback communication over stationary finite dimensional Gaussian channels as feedback control systems by showing that, the problem of finding stabilizing feedback controllers with maximal reliable…

Information Theory · Computer Science 2015-12-01 Chong Li , Nicola Elia

In this paper, we examine an input-constrained erasure channel and we characterize the asymptotics of its capacity when the erasure rate is low. More specifically, for a general memoryless erasure channel with its input supported on an…

Information Theory · Computer Science 2016-05-10 Yonglong Li , Guangyue Han

The tremendous capacity gains promised by space division multiple access (SDMA) depend critically on the accuracy of the transmit channel state information. In the broadcast channel, even without any network interference, it is known that…

Information Theory · Computer Science 2016-11-17 Marios Kountouris , Jeffrey G. Andrews