Proceedings ArticleDOI
Efficient variable length channel coding for unknown DMCs
Stark C. Draper,Brendan J. Frey,Frank R. Kschischang +2 more
- pp 379-379
TLDR
By choosing the size of the codebook large enough, the rate that is reliably realized by the strategy can be made to approach arbitrarily closely the mutual information between channel input and output induced by the user-chosen input distribution.Abstract:
We present a strategy for the reliable communication of a message, in a variable number of channel uses, over an unknown discrete memoryless channel (DMC). The decoder periodically tests the received sequence and, when it can decode, sends an acknowledgment to the transmitter, which then stops transmitting. By choosing the size of the codebook large enough, the rate that is reliably realized by the strategy can be made to approach arbitrarily closely the mutual information between channel input and output induced by the user-chosen input distribution. The strategy presented can be considered as a generalization to arbitrary unknown DMCs of earlier variable length coding schemes, such as digital fountain codes for binary erasure channels (BECs), and a coding strategy for binary symmetric channels (BSCs) presented by Tchamkerten and Telatarread more
Citations
More filters
Channel coding: non-asymptotic fundamental limits
TL;DR: In this article, the authors studied the behavior of the fundamental limits in the non-asymptotic regime for blocklengths of the order of 1000 and showed that in several instances classical (asymptonotics-based) conclusions do not hold under this more refined approach.
Journal ArticleDOI
Feedback in the Non-Asymptotic Regime
TL;DR: Novel achievability bounds are used to demonstrate that in the non-asymptotic regime, the maximal achievable rate improves dramatically thanks to variable-length coding and feedback, and practically all the advantages of noiseless feedback are shown to be achievable.
Journal ArticleDOI
Performance of Fountain Codes in Collaborative Relay Networks
TL;DR: It is shown that the concept of mutual- information-accumulation can be realized with the help of fountain codes, and leads to a lower energy expenditure and a lower transmission time than energy accumulation.
Journal ArticleDOI
Rateless coding over fading channels
J. Castura,Yongyi Mao +1 more
TL;DR: An implementation using fountain codes is simulated, demonstrating that such a scheme has advantages in efficiency, reliability and robustness over conventional fixed-rate codes, particularly when channel state information is not available at the transmitter.
Journal ArticleDOI
Rateless Coding for Wireless Relay Channels
J. Castura,Yongyi Mao +1 more
TL;DR: With a concrete Fountain-code implementation of this framework, it is shown that rateless codes are both robust and efficient when the channel state information is not available at the transmitters.
References
More filters
Book
Information Theory: Coding Theorems for Discrete Memoryless Systems
I. Csiszar,János Körner +1 more
TL;DR: This new edition presents unique discussions of information theoretic secrecy and of zero-error information theory, including the deep connections of the latter with extremal combinatorics.
Proceedings Article
LT codes
TL;DR: LT codes are introduced, the first rateless erasure codes that are very efficient as the data length grows, and are based on EMMARM code, which was introduced in version 2.0.
Proceedings ArticleDOI
A feedback strategy for binary symmetric channels
Aslan Tchamkerten,Emre Telatar +1 more
TL;DR: This work describes a universal scheme based on a decision feedback strategy that allows communication over unknown binary symmetric channels with instantaneous and perfect feedback.