Detailed Asymptotics of the Delay-Reliability Tradeoff of Random Linear Streaming Codes

Pin Wen Su*, Yu Chih Huang, Shih Chun Lin, I. Hsiang Wang, Chih Chun Wang*

*此作品的通信作者

研究成果: Conference contribution同行評審

3 引文 斯高帕斯(Scopus)

摘要

Streaming codes eliminate the queueing delay and are an appealing candidate for low latency communications. This work studies the tradeoff between error probability pe and decoding deadline of infinite-memory random linear streaming codes (RLSCs) over i.i.d. symbol erasure channels (SECs). The contributions include (i) Proving pe() ~ ?-1.5e-?. The asymptotic power term-1.5 of RLSCs is a strict improvement over the-0.5 term of random linear block codes; (ii) Deriving a pair of upper and lower bounds on the asymptotic constant ?, which are tight (i.e., identical) for one specific class of SECs; (iii) For any c > 1 and any decoding deadline, the c-optimal memory length a c*(?) is defined as the minimal memory length a needed for the resulting pe to be within a factor of c of the best possible pe* under any a, an important piece of information for practical implementation. This work studies and derives new properties of a c*(?) based on the newly developed asymptotics.

原文English
主出版物標題2023 IEEE International Symposium on Information Theory, ISIT 2023
發行者Institute of Electrical and Electronics Engineers Inc.
頁面1124-1129
頁數6
ISBN(電子)9781665475549
DOIs
出版狀態Published - 2023
事件2023 IEEE International Symposium on Information Theory, ISIT 2023 - Taipei, Taiwan
持續時間: 25 6月 202330 6月 2023

出版系列

名字IEEE International Symposium on Information Theory - Proceedings
2023-June
ISSN(列印)2157-8095

Conference

Conference2023 IEEE International Symposium on Information Theory, ISIT 2023
國家/地區Taiwan
城市Taipei
期間25/06/2330/06/23

指紋

深入研究「Detailed Asymptotics of the Delay-Reliability Tradeoff of Random Linear Streaming Codes」主題。共同形成了獨特的指紋。

引用此