TY - GEN
T1 - Detailed Asymptotics of the Delay-Reliability Tradeoff of Random Linear Streaming Codes
AU - Su, Pin Wen
AU - Huang, Yu Chih
AU - Lin, Shih Chun
AU - Wang, I. Hsiang
AU - Wang, Chih Chun
N1 - Publisher Copyright:
© 2023 IEEE.
PY - 2023
Y1 - 2023
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85171426779&partnerID=8YFLogxK
U2 - 10.1109/ISIT54713.2023.10206973
DO - 10.1109/ISIT54713.2023.10206973
M3 - Conference contribution
AN - SCOPUS:85171426779
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 1124
EP - 1129
BT - 2023 IEEE International Symposium on Information Theory, ISIT 2023
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2023 IEEE International Symposium on Information Theory, ISIT 2023
Y2 - 25 June 2023 through 30 June 2023
ER -