This is the authors' abstract. We don't add key points for this paper.
Streaming codes take a string of source symbols as input and output a string of coded symbols in real time, which eliminate the queueing delay of traditional block codes and are thus especially appealing for delay sensitive applications. This work studies the asymptotics of random linear streaming codes (RLSCs) in the large finite-field-size regime under the i.i.d. symbol erasure channel models. Two important scenarios are analyzed: (i) tradeoff between decoding deadline Δ and probability of error pe assuming infinite memory α = ∞; and (ii) tradeoff between α and pe assuming infinite Δ = ∞. For each scenario, this work derives the corresponding asymptotic constant ρ, power β and decay rate η that satisfy pe(x) ∼ ρxβe−ηx. The results of (i) and (ii) are then used to study an important code design problem: Under a given target deadline Δ, what is the memory length α needed for the error probability pe to be within a factor of c > 1 of the best possible p∗ e over α. Further analysis also suggests that regardless the c value being considered, the necessary memory length is approximately 3–7% of the target deadline Δ when Δ is large, the actual percentage depending on the channel model and the coding rate. Such a prediction is consistent with existing brute-force-based evaluations.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Su et al. (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: