TY - GEN
T1 - Optimal finite-length linear codes and the corresponding channel dispersion for broadcast packet erasure channels with feedback
AU - Lin, Shih Chun
AU - Lai, Yi Chun
AU - Huang, Yu Chih
AU - Wang, Chih Chun
AU - Wang, I. Hsiang
N1 - Publisher Copyright:
© 2021 IEEE.
PY - 2021
Y1 - 2021
N2 - With the recent emergence of many low-latency applications over wireless networks, the need for accurate finite-length analysis of channel coding over multi-user wireless channels is ever increasing. This paper focuses exclusively on the two-user broadcast packet erasure channel (PEC) with causal feedback, for which existing results show that various linear network coding (LNC) schemes can attain the broadcast capacity region when the block length approaches infinity. Instead of the asymptotic capacity-based analysis, this work derives the exact value of the LNC-based broadcast channel dispersion. Our approach is based on a new explicit characterization of the optimal LNC scheme under any arbitrarily given finite block length. The results show that among all existing asymptotically capacity-achieving LNC schemes, one (class) of them is provably finite-length optimal. By analyzing its second-order asymptotic, we have thus derived the exact (optimal) LNC broadcast channel dispersion, which closes the gap of the state-of-the-art inner and outer bounds previously derived in Lin et al. ISIT 2021.
AB - With the recent emergence of many low-latency applications over wireless networks, the need for accurate finite-length analysis of channel coding over multi-user wireless channels is ever increasing. This paper focuses exclusively on the two-user broadcast packet erasure channel (PEC) with causal feedback, for which existing results show that various linear network coding (LNC) schemes can attain the broadcast capacity region when the block length approaches infinity. Instead of the asymptotic capacity-based analysis, this work derives the exact value of the LNC-based broadcast channel dispersion. Our approach is based on a new explicit characterization of the optimal LNC scheme under any arbitrarily given finite block length. The results show that among all existing asymptotically capacity-achieving LNC schemes, one (class) of them is provably finite-length optimal. By analyzing its second-order asymptotic, we have thus derived the exact (optimal) LNC broadcast channel dispersion, which closes the gap of the state-of-the-art inner and outer bounds previously derived in Lin et al. ISIT 2021.
UR - http://www.scopus.com/inward/record.url?scp=85123443850&partnerID=8YFLogxK
U2 - 10.1109/ITW48936.2021.9611386
DO - 10.1109/ITW48936.2021.9611386
M3 - Conference contribution
AN - SCOPUS:85123443850
T3 - 2021 IEEE Information Theory Workshop, ITW 2021 - Proceedings
BT - 2021 IEEE Information Theory Workshop, ITW 2021 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2021 IEEE Information Theory Workshop, ITW 2021
Y2 - 17 October 2021 through 21 October 2021
ER -