Su, Pin WenPin WenSuHuang, Yu ChihYu ChihHuangSHIH-CHUN LINI-HSIANG WANGWang, Chih ChunChih ChunWang2023-10-182023-10-182023-01-01978166547554921578095https://scholars.lib.ntu.edu.tw/handle/123456789/636149Streaming 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.conference paper10.1109/ISIT54713.2023.102069732-s2.0-85171426779https://api.elsevier.com/content/abstract/scopus_id/85171426779