English
Related papers

Related papers: Bounds on the Effective-length of Optimal Codes fo…

200 papers

The fundamental limits of communication over state-dependent discrete memoryless channels with noiseless feedback are studied, under the assumption that the communicating parties are allowed to use variable-length coding schemes. Various…

Information Theory · Computer Science 2020-08-13 Mladen Kovačević , Carol Wang , Vincent Y. F. Tan

Feedback holds a pivotal role in practical communication schemes, even though it does not enhance channel capacity. Its main attribute includes adaptability in transmission that allows for a higher rate of convergence of the error…

Information Theory · Computer Science 2024-03-22 Ioannis Papoutsidakis , Robert J. Piechocki , Angela Doufexi

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 design of codes for feedback-enabled communications has been a long-standing open problem. Recent research on non-linear, deep learning-based coding schemes have demonstrated significant improvements in communication reliability over…

Information Theory · Computer Science 2023-06-09 Junghoon Kim , Taejoon Kim , David Love , Christopher Brinton

We consider the problem of synthesizing joint distributions of signals and actions over noisy channels in the finite-length regime. For a fixed blocklength $n$ and an upper bound on the distance $\varepsilon$, a coding scheme is proposed…

Information Theory · Computer Science 2019-09-30 Giulia Cervia , Tobias Oechtering , Mikael Skoglund

Traditional asymptotic information-theoretic studies of the fundamental limits of wireless communication systems primarily rely on some ideal assumptions, such as infinite blocklength and vanishing error probability. While these assumptions…

Information Theory · Computer Science 2025-12-29 Junyuan Gao , Shuao Chen , Yongpeng Wu , Liang Liu , Giuseppe Caire , H. Vincent Poor , Wenjun Zhang

Empirical coordination offers a way to understand how agents can coordinate actions under communication constraints. This paper investigates the finite blocklength regime of this problem, where the encoder and decoder aim to produce a…

Information Theory · Computer Science 2026-05-13 Olivier Massicot , Giulia Cervia , Maël Le Treust

We construct error correcting codes for jointly transmitting a finite set of independent messages to an 'informed receiver' which has prior knowledge of the values of some subset of the messages as side information. The transmitter is…

Information Theory · Computer Science 2016-04-08 Lakshmi Natarajan , Yi Hong , Emanuele Viterbo

An index coding problem arises when there is a single source with a number of messages and multiple receivers each wanting a subset of messages and knowing a different set of messages a priori. The noiseless Index Coding Problem is to…

Information Theory · Computer Science 2015-10-13 Kavitha R. , Niranjana Ambadi , B. Sundar Rajan

Existing fixed-length feedback communication schemes are either specialized to particular channels (Schalkwijk--Kailath, Horstein), or apply to general channels but either have high coding complexity (block feedback schemes) or are…

Information Theory · Computer Science 2016-09-08 Cheuk Ting Li , Abbas El Gamal

We present an upper bound on the error probability achievable using variable-length stop feedback codes, for a fixed size of the information payload and a given constraint on the maximum latency and the average service time. Differently…

Information Theory · Computer Science 2020-02-20 Johan Östman , Rahul Devassy , Giuseppe Durisi , Erik G. Ström

We study variable-length feedback (VLF) codes under a strict delay constraint to maximize their average transmission rate (ATR) in a discrete memoryless channel (DMC) while considering periodic decoding attempts. We first derive a lower…

Information Theory · Computer Science 2015-02-25 Seong Hwan Kim , Dan Keun Sung , Tho Le-Ngoc

This paper investigates variable-length stop-feedback codes for memoryless channels in point-to-point, multiple access, and random access communication scenarios. The proposed codes employ $L$ decoding times $n_1, n_2, \dots, n_L$ for the…

Information Theory · Computer Science 2023-12-12 Recep Can Yavas , Victoria Kostina , Michelle Effros

Ultra-Reliable Low-Latency Communications have stringent delay constraints, and hence use codes with small block length (short codewords). In these cases, classical models that provide good approximations to systems with infinitely long…

Information Theory · Computer Science 2021-01-29 Nourhan Hesham , Anas Chaaban

In this paper, we establish a new bound tying together the effective length and the maximum correlation between the outputs of an arbitrary pair of Boolean functions which operate on two sequences of correlated random variables. We derive a…

Information Theory · Computer Science 2017-05-02 Farhad Shirani , S. Sandeep Pradhan

With the expected proliferation of delay constrained applications, future communication technologies are pushed towards using short codes. The performance using short codes cannot be inferred through classical channel capacity analysis,…

Information Theory · Computer Science 2023-12-19 Nourhan Hesham , Hesham ElSawy , Jahangir Hossain , Anas Chaaban

In many wireless systems, the channel state information at the transmitter (CSIT) can not be learned until after a transmission has taken place and is thereby outdated. In this paper, we study the benefits of delayed CSIT on a block-fading…

Information Theory · Computer Science 2014-01-29 Kasper Fløe Trillingsgaard , Petar Popovski

Space-time codes leverage the availability of multiple antennas to enhance the reliability of communication over wireless channels. While space-time codes have initially been designed with a focus on open-loop systems, recent technological…

Information Theory · Computer Science 2016-11-17 Che Lin , Vasanthan Raghavan , Venu Veeravalli

We propose two application-layer coding schemes for delay-constrained point-to-point packet communications with restrictions on the transmitter's maximum duty-cycle. The schemes operate over GF(2) and utilize intermittently available…

Networking and Internet Architecture · Computer Science 2020-04-14 Siddhartha S. Borkotoky , Udo Schilcher , Christian Raffelsberger

We develop upper bounds on code size for an independent and identically distributed deletion and insertion channels for a given code length and target frame error probability. The bounds are obtained as a variation of a general converse…

Information Theory · Computer Science 2026-04-14 Ruslan Morozov , Tolga Mete Duman