English
Related papers

Related papers: On the Reliability Function for a BSC with Noisele…

200 papers

This paper investigates the secrecy capacity of the binary beampointing (BBP) channel with block memory and feedback, a simplified yet insightful model for millimeter-wave (mmWave) systems with beamformed transmissions and backscatter…

Information Theory · Computer Science 2025-08-29 Siyao Li , Mingzhe Chen , Shuangyang Li , Giuseppe Caire

Designing encoding and decoding circuits to reliably send messages over many uses of a noisy channel is a central problem in communication theory. When studying the optimal transmission rates achievable with asymptotically vanishing error…

Quantum Physics · Physics 2024-11-07 Matthias Christandl , Alexander Müller-Hermes

This paper studies pliable index coding, in which a sender broadcasts information to multiple receivers through a shared broadcast medium, and the receivers each have some message a priori and want any message they do not have. An approach,…

Information Theory · Computer Science 2019-10-02 Lawrence Ong , Badri N. Vellambi , Jörg Kliewer , Parastoo Sadeghi

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

In this paper, we study ultra-reliable and low-latency communication (URLLC) under fading using multiple frequency or time bins. We investigate an approach to find an upper-bound on the packet error rate when a finite-length code is used.…

Information Theory · Computer Science 2019-04-08 Jinho Choi

The error performance of the ensemble of typical LDPC codes transmitted over the binary erasure channel (BEC) is analyzed. In the past, lower bounds on the error exponents were derived. In this paper a probabilistic upper bound on this…

Information Theory · Computer Science 2008-03-18 Idan Goldenberg , David Burshtein

The paper considers the input-constrained binary erasure channel (BEC) with causal, noiseless feedback. The channel input sequence respects the $(d,\infty)$-runlength limited (RLL) constraint, i.e., any pair of successive $1$s must be…

Information Theory · Computer Science 2021-02-19 V. Arvind Rameshwar , Navin Kashyap

In this paper, we study the zero-error capacity for finite state channels with feedback when channel state information is known to both the transmitter and the receiver. We prove that the zero-error capacity in this case can be obtained…

Information Theory · Computer Science 2009-07-14 Lei Zhao , Haim Permuter

The asymptotic iterative decoding performances of low-density parity-check (LDPC) codes using min-sum (MS) and sum-product (SP) decoding algorithms on memoryless binary-input output-symmetric (MBIOS) channels are analyzed in this paper. For…

Information Theory · Computer Science 2007-07-13 Chun-Hao Hsu , Achilleas Anastasopoulos

This paper concerns the maximum coding rate at which data can be transmitted over a noncoherent, single-antenna, Rayleigh block-fading channel using an error-correcting code of a given blocklength with a block-error probability not…

Information Theory · Computer Science 2020-03-31 Alejandro Lancho , Tobias Koch , Giuseppe Durisi

Improved bounds on the blocklength required to communicate over binary-input channels using polar codes, below some given error probability, are derived. For that purpose, an improved bound on the number of non-polarizing channels is…

Information Theory · Computer Science 2013-07-23 Dina Goldin , David Burshtein

We examine the capacity of beamforming over a single-user, multi-antenna link taking into account the overhead due to channel estimation and limited feedback of channel state information. Multi-input single-output (MISO) and multi-input…

Information Theory · Computer Science 2010-11-22 Wiroonsak Santipach , Michael L. Honig

Even though machine learning (ML) techniques are being widely used in communications, the question of how to train communication systems has received surprisingly little attention. In this paper, we show that the commonly used binary…

Information Theory · Computer Science 2023-03-08 Reinhard Wiesmayr , Gian Marti , Chris Dick , Haochuan Song , Christoph Studer

In this paper, we consider quantized decoding of LDPC codes on the binary symmetric channel. The binary message passing algorithms, while allowing extremely fast hardware implementation, are not very attractive from the perspective of…

Information Theory · Computer Science 2016-11-17 Lucile Sassatelli , Shashi Kiran Chilappagari , Bane Vasic , David Declercq

When information is to be transmitted over an unknown, possibly unreliable channel, an erasure option at the decoder is desirable. Using constant-composition random codes, we propose a generalization of Csiszar and Korner's Maximum Mutual…

Information Theory · Computer Science 2016-11-17 Pierre Moulin

In this letter, we derive the impulse response of the channel with a spherical absorbing receiver, a spherical reflecting boundary, and a point transmitter in molecular communication domain. By exploring the channel characteristics and…

Emerging Technologies · Computer Science 2019-12-11 Fatih Dinc , Bayram Cevdet Akdeniz , Ali Emre Pusane , Tuna Tugcu

We consider the problem of transmitting a bivariate Gaussian source over a two-user additive Gaussian multiple-access channel with feedback. Each of the transmitters observes one of the source components and tries to describe it to the…

Information Theory · Computer Science 2007-07-16 Amos Lapidoth , Stephan Tinguely

The zero-error feedback capacity of the Gelfand-Pinsker channel is established. It can be positive even if the channel's zero-error capacity is zero in the absence of feedback. Moreover, the error-free transmission of a single bit may…

Information Theory · Computer Science 2016-07-11 Annina Bracher , Amos Lapidoth

Training-based transmission over Rayleigh block-fading multiple-input multiple-output (MIMO) channels is investigated. As a training method a combination of a pilot-assisted scheme and a biased signaling scheme is considered. The achievable…

Information Theory · Computer Science 2016-11-18 Keigo Takeuchi , Ralf R. Mueller , Mikko Vehkaperae , Toshiyuki Tanaka

It is shown that for any binary-input discrete memoryless channel $W$ with symmetric capacity $I(W)$ and any rate $R <I(W)$, the probability of block decoding error for polar coding under successive cancellation decoding satisfies $P_e \le…

Information Theory · Computer Science 2009-04-06 Erdal Arikan , Emre Telatar