Title
Variable-Length Feedback Codes Under a Strict Delay Constraint
Abstract
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 bound on the maximum achievable ATR, and confirm that the VLF code can outperform non-feedback codes with a larger delay constraint. We show that for a given decoding period, as the strict delay constraint, , increases, the gap between the ATR of the VLF code and the DMC capacity scales at most on the order of instead of for non-feedback codes as shown in Polyanskiy et al. [“Channel coding rate in the finite blocklength regime,” IEEE Trans. Inf. Theory, vol. 56, no. 5, pp. 2307–2359, May 2010] . We also develop an approximation indicating that, for a given , the achievable ATR increases as the decoding period decreases.
Year
DOI
Venue
2015
10.1109/LCOMM.2015.2398866
Communications Letters, IEEE  
Keywords
Field
DocType
Decoding,Delays,Receivers,Approximation methods,Encoding,Transmitters,Random variables
Transmission rate,Discrete mathematics,Random variable,Code rate,Upper and lower bounds,Control theory,Communication channel,Real-time computing,Decoding methods,Periodic graph (geometry),Mathematics,Encoding (memory)
Journal
Volume
Issue
ISSN
19
4
1089-7798
Citations 
PageRank 
References 
0
0.34
6
Authors
3
Name
Order
Citations
PageRank
Seong Hwan Kim133431.76
Dan Keun Sung21478147.84
Tho Le-Ngoc32210237.14