--- title: Random Linear Streaming Codes (RLSCs) url: https://www.emergentmind.com/topics/random-linear-streaming-codes-rlscs type: topic --- # Random Linear Streaming Codes (RLSCs) Random Linear Streaming Codes (RLSCs) are streaming-oriented erasure-control schemes in which transmitted packets are random linear combinations of source data formed under causal delay constraints. In the literature represented here, the term spans several closely related models: generation-based application-layer streaming in which packets are partitioned into generations and served in round-robin order, sliding-window non-systematic and systematic encoders over symbol or packet erasure channels, large-field pipelined schemes for multi-hop relay networks, and sparse broadcast formulations linked to sparse random linear network coding. Across these settings, recovery is determined by full-rank or row-space conditions of accumulated random coding matrices, while performance is measured through delivery packet count, net throughput, energy consumption, or long-run slot error probability [1206.3014][2509.01894][2512.15049][1705.09473]. ## 1. Scope and canonical constructions In the generation-based formulation, a file is chopped into \(N\) fixed-size blocks (“packets”) of \(B\) bits each and partitioned into \(n\) disjoint subsets \(G_1,\dots,G_n\) of equal size \(g\), so \(N=n\cdot g\). Each subset is a generation, and coding mixes packets only within a single generation. To form the \(t\)-th coded packet from generation \(G_j\), the encoder draws a coefficient vector \(c=[c_1,\dots,c_g]\in GF(q)^g\) with entries chosen i.i.d. uniformly in \(GF(q)\), and computes the coded payload \(y=c\cdot G_j\). The packet header carries enough information to reconstruct \(c\), either as an explicit header of \(g\) field elements or as a short PRNG seed with a deterministic generator. Generations are then served in cyclic order according to \(j(t)=1+(t \bmod n)\), so one coded packet per generation is emitted in each round, without feedback until the end [1206.3014]. A later single-hop streaming formulation replaces generations with a sliding memory of length \(\alpha\). In the non-systematic case, at each timeslot \(t\), \(K\) new source symbols \(\mathbf{s}(t)\in GF(2^q)^K\) arrive and are stored with the previous \(\alpha\) slots. The encoder multiplies the \((\alpha+1)K\) symbols \(\{\mathbf{s}(t-\alpha),\dots,\mathbf{s}(t)\}\) by a random generator matrix \(\mathbf{G}_t\in (GF(2^q)\setminus\{0\})^{N\times (\alpha+1)K}\), with all entries chosen i.i.d. uniformly over nonzero field elements, and transmits \(\mathbf{x}(t)=\mathbf{G}_t[\mathbf{s}(t-\alpha)^\top,\dots,\mathbf{s}(t)^\top]^\top\). The systematic variant keeps the same memory length \(\alpha\), but partitions each transmitted packet into a systematic block \(x_1(t),\dots,x_K(t)=\mathbf{s}(t)\) and a parity block consisting of random linear combinations of the \((\alpha+1)K\) most recent source symbols [2509.01894]. In the multi-hop relay formulation, node \(\ell\) at time \(t\) stores all correctly received packets up to time \(t\) in memory \(m_\ell(t)\), and transmits one packet of length \(N_\ell\) over \(\mathbb{F}_q\) according to \(x_\ell(t)=G_\ell(t)\,m_\ell(t)\), where \(G_\ell(t)\) is an \(N_\ell\times |m_\ell(t)|\) matrix whose non-zero entries are drawn uniformly at random from \(\mathbb{F}_q\setminus\{0\}\). The analysis assumes \(q\to\infty\) and the GMDS property, namely that any full-matching submatrix of \(G_\ell(t)\) is invertible [2512.15049]. These constructions share the same underlying principle—random linear mixing of recently available source data—but differ in how “recently available” is defined: by generation, by sliding window, or by per-node memory. This suggests that “RLSC” denotes a family of causally encoded random-linear streaming schemes rather than a single fixed encoder architecture. ## 2. Decoding criteria and computational structure For generation-based round-robin transmission, the receiver maintains, for each generation \(G_k\), a buffer of received \((c_i,y_i)\) pairs. Let \(C_k\) denote the collected coding vectors and \(Y_k\) the corresponding payloads. Once \(|C_k|\ge g\), the decoder attempts Gaussian elimination on \(C_k\in GF(q)^{m\times g}\), \(m\ge g\). If \(\mathrm{rank}(C_k)=g\), it recovers the original \(g\) blocks by solving \(C_k\cdot X=Y_k\), and after recovery it drops any further packets of that generation from the buffer. Storing up to \(m\le g+\delta\) coding vectors requires \(O(m\cdot g)\) words of \(GF(q)\) memory plus \(O(m\cdot B)\) bits of payload buffer, while Gaussian elimination costs \(O(g^2\cdot m)\) arithmetic operations and \(O(g^3)\) in the worst case \(m=g\). Thus per-generation decoding has cubic field-operation complexity and \(O(g\cdot B)\) storage [1206.3014]. In sliding-window single-hop RLSCs, the receiver accumulates per-slot observation matrices \(\mathbf{H}_t\), obtained by restricting \(\mathbf{G}_t\) to the rows corresponding to received symbols. These are stacked into cumulative matrices \(\mathbf{H}^{(t)}\). A source symbol \(s_k(\tau)\) is decodable by time \(\tau+\Delta\) if the corresponding unit vector lies in the row-space of \(\mathbf{H}^{(\tau+\Delta)}\). Under the large-\(q\) almost-MDS assumption, decoding succeeds if and only if enough linear equations arrive within the decoding deadline [2509.01894]. In multi-hop relay networks, if \(H_\ell(t)\) denotes \(G_\ell(t)\) with erased rows removed, then the received equations at the destination satisfy \[ y_{L-1}(1:t)=\mathcal{J}(t)\,s(1:t), \] where \(s(1:t)\equiv[s(1);\dots;s(t)]\) and \(\mathcal{J}(t)\) is the overall receiver matrix obtained from the products of the \(H\)'s and \(G\)'s across the \(L\) hops. A symbol \(s_k(t_0)\) is \(\Delta\)-decodable at time \(T=t_0+\Delta\) if the unit vector \(e_{(t_0-1)K+k}^\top\) lies in the row-space of \(\mathcal{J}(T)\). Equivalently, the destination must have collected at least \(K\cdot t_0\) independent equations involving the first \(t_0\) source blocks by time \(T\) [2512.15049]. Across all three formulations, decoding is therefore an algebraic rank test on accumulated random linear equations. The principal implementation distinction is not the decoding rule itself, but the state variable that determines which source symbols can still participate in future equations. ## 3. Delivery count, throughput, and energy in generation-based RLSCs For generation-based pure random linear coding over \(GF(q)\), let \(\epsilon\) be the memoryless packet-erasure probability. After \(m\) transmissions from one generation, the probability of successful decoding is \[ p_{m,g,\epsilon}^{RL} = \sum_{j=g}^m \binom{m}{j}(1-\epsilon)^j\epsilon^{m-j} \prod_{s=0}^{g-1}(1-q^{s-j}), \] where the product is the probability that a random \(j\times g\) matrix over \(GF(q)\) has rank \(g\). When \(q\) is large, this is approximated by the corresponding binomial tail. If \(n=N/g\) is the number of generations and \(p_t\) is the probability that all \(n\) generations are decoded by time \(t\), the expected delivery packet count satisfies \[ E[T]=\sum_{t=0}^{\infty}(1-p_t)\simeq n\sum_{m=0}^{\infty}\bigl(1-(p_{m,g,\epsilon})^n\bigr). \] The net throughput is \[ \eta=\frac{g\cdot B}{E[\text{transmissions}]}, \] and, with physical-layer rate \(R_{\text{phy}}\), the expected delivery time per generation is \(T_{\text{delivery}}\approx E[\text{transmissions}]/R_{\text{phy}}\). On a battery-powered terminal, if energy is dominated by radio-on time, then \(E_{\text{energy}}\approx P_{\text{on}}\cdot T_{\text{delivery}}\approx P_{\text{on}}\cdot(E[\text{transmissions}]/R_{\text{phy}})\) [1206.3014]. The same framework permits direct comparison among pure RL, systematic RL, and MDS coding. Systematic RL sends the \(g\) original packets first and then random combinations; its per-generation success probability is \[ p_{m,g,\epsilon}^{RLS} =(1-\epsilon)^g+\sum_{\ell=0}^{g-1}\binom{g}{\ell}(1-\epsilon)^\ell\epsilon^{g-\ell}\, p_{m-g,\,g-\ell,\,\epsilon}^{RL}. \] MDS codes, such as \((K,g)\) Reed–Solomon codes, guarantee recovery as soon as any \(g\) out of the \(K\) codewords are received, and their round-robin success probability can be written in the closed-form double-sum given as Eq. (5) in the paper. The resulting comparison is not purely asymptotic: the model tracks the interaction between erasures, generation size, round-robin service, and coding overhead, and thereby translates algebraic recovery behavior into throughput and energy terms [1206.3014]. A recurring conclusion in this line of work is that coding overhead, delivery packet count, and energy are tightly coupled. In this model, improved rank accumulation reduces expected communication time, and reduced communication time lowers energy consumption when the radio dominates the power budget. ## 4. Information debt and exact error analysis in stochastic channels For non-systematic RLSCs in a Gilbert–Elliott symbol erasure channel, the channel state \(a_t\in\{G,B\}\) evolves as a hidden two-state Markov chain with transition matrix \[ T_1=\begin{bmatrix}1-p & p \\ r & 1-r\end{bmatrix}, \] and stationary distribution \(\pi=[r/(p+r),\,p/(p+r)]\). If \(C_t\) symbols are received at slot \(t\), the analysis is organized around the information debt \(I_d(t)\), which counts the missing equations required before the decoder can clear all past unknowns. With \(\zeta=\alpha K+1\), \[ \hat I_d(t)=\bigl(K-C_t+\min\{I_d(t-1),\alpha K\}\bigr)^+,\qquad I_d(t)=\min\{\zeta,\hat I_d(t)\}. \] Zero-hitting times \(t_i\) and ceiling-hitting times \(\tau_j\) partition the process into renewal cycles. A renewal-reward argument yields the long-run slot-error probability \[ P_e^{ns}=\frac{\mathbb{E}[L_G]+\mathbb{E}[L_{B_1}]+\mathbb{E}[L_{B_2}]} {\mathbb{E}[t_{i+1}-t_i]}, \] where \(L_G\) counts undecodable slots in cycles with no ceiling hit, and \(L_{B_1},L_{B_2}\) account for partial cycles that do hit \(\zeta\). The paper then derives closed forms for the cycle-length distribution, the stationary start distribution at zero hits, and the expectation terms using debt-transition matrices \(\Gamma^G,\Gamma^B\), block matrices built from them, and sums of matrix powers [2509.01894]. The same paper analyzes systematic RLSCs in the packet erasure channel, where each packet is either received perfectly with probability \(p\) or completely erased with probability \(1-p\). Here the immediate availability of the systematic symbols forces a modified debt process with a time-varying ceiling \(\zeta(t)\) and reset time \(t_c\). The resulting error characterization is more subtle than in the non-systematic case. In each renewal cycle, only erasure slots can fail; if no \(\tau_j\) occurs, every \(t\in(t_i,t_{i+1}-\Delta)\) with \(e(t)=1\) is an error, while if some \(\tau_j\) occurs, the last such \(\tau_{j^*}\) determines the failing interval \(\bigl(t_i,\max\{\tau_{j^*}-\alpha+1,\,t_{i+1}-\Delta\}\bigr)\). The paper also gives a counter-intuitive example: with \(K=N-K\), \(\alpha=3\), and \(\Delta=6\), an 8-slot erasure pattern exists in which NRLSC decodes all symbols but SRLSC fails on 3 of them, due to de-correlation of parity with earlier symbols once some systematic slots arrive. For \(\alpha\to\infty\) and coding rate \(1/2\), an exact expression is derived for \(P_e^{sys}\) in terms of an integral involving a Toeplitz transition matrix and a Catalan-number expansion for the expected number of error slots [2509.01894]. This body of analysis replaces worst-case bounded-erasure reasoning with exact stochastic characterization under i.i.d. and Markov channels. It also shows that systematic transmission changes more than latency: it changes the combinatorics of which erasure patterns are recoverable by deadline. ## 5. Multi-hop relay networks and band-structured Markov analysis Large-field RLSCs in multi-hop relay networks are analyzed through a notion of detained symbols and information debt generalized from point-to-point networks. If \(S(m_\ell(t))\) denotes the total number of source symbols represented in the memory of node \(\ell\) at time \(t\), the detained symbols between nodes \(\ell\) and \(\ell+1\) are \[ D_\ell(t)=S(m_\ell(t))-S(m_{\ell+1}(t)). \] At the destination, \(W(t)=|y_{L-1}(1:t)|\) is the number of equations collected, and the destination information debt is \(I_d(t)=[D_L(t)-W(t)]^+\). For the two-hop case, the detained-symbol process obeys coupled recurrences: \[ D_0(t)=D_0(t-1)e_0(t-1)+K, \] \[ D_1(t)=D_1(t-1)e_1(t-1)+D_0(t)(1-e_0(t)), \] \[ D_2(t)=D_2(t-1)\mathbf{1}_{I_d(t-1)>0}+D_1(t)(1-e_1(t)), \] \[ W(t)=W(t-1)\mathbf{1}_{I_d(t-1)>0}+N_2(1-e_1(t)), \] \[ I_d(t)=[D_2(t)-W(t)]^+. \] The times \(t_i\) at which \(I_d(t_i)=0\) define rounds; in each round, one decodes \(D_2(t_i)\) symbols from \(W(t_i)\) equations [2512.15049]. The stochastic analysis models \((D_0,D_1,I_d)\) as an infinite Markov chain, then truncates the state variables at large caps \(m_0,m_1,m_2\) and constructs a joint transition matrix with a “two-level band” structure. The basic building block is the matrix \(D_{i,q,m}\), whose deliver band resets the state to zero with probability \(q\), while its erasure band advances by \(i\) with probability \(1-q\). By nesting these blocks, the analysis forms \(M^{(0)}\) for \(D_0\), then \(M^{(1)}\) for \((D_0,D_1)\), and finally embeds the \(I_d\) transitions into four sparse matrices \(T_{0,0}\), \(T_{0,\phi}\), \(T_{\phi,\phi}\), and \(T_{\phi,0}\), corresponding respectively to \(I_d=0\to0\), \(0\to\) nonzero, nonzero \(\to\) nonzero, and nonzero \(\to0\). The stationary distribution \(\pi^\infty\) at renewal instants then yields the inter-hit probabilities \[ \Pr(t_{i+1}-t_i=1)=\pi^\infty T_{0,0}\mathbf{1}, \] \[ \Pr(t_{i+1}-t_i=k)=\pi^\infty T_{0,\phi}T_{\phi,\phi}^{k-2}T_{\phi,0}\mathbf{1},\qquad k\ge2. \] From these matrices, the long-run slot error rate is expressed as a ratio of steady-state expectations over one round, and the denominator admits a closed-form information-balance identity with \(A=(I-T_{\phi,\phi})^{-1}\). The same nesting procedure extends verbatim to an arbitrary number of hops by enlarging the band-structured transition matrices [2512.15049]. This framework is significant because it converts a causal multi-hop streaming problem into a renewal-theoretic Markov analysis driven by detained-symbol random walks. The key conceptual move is that loss propagation across hops is represented not by explicit pathwise decoding states, but by the amount of source information still “in flight” between consecutive nodes. ## 6. Sparse broadcast variants, empirical results, and design limits In point-to-multipoint broadcast, a related sparse formulation encodes a \(K\)-packet source message \(\{\mathbf{s}_1,\dots,\mathbf{s}_K\}\), \(\mathbf{s}_i\in\mathbb{F}_q^L\), into rateless coded packets \[ \mathbf{c}_j=\sum_{i=1}^K g_{i,j}\mathbf{s}_i, \] with coding coefficients distributed as \[ \Pr[g_{i,j}=0]=p,\qquad \Pr[g_{i,j}=v]=\frac{1-p}{q-1}\quad (v\ne0). \] If \(n\) out of \(N\) transmissions are received, the receiver forms a \(K\times n\) matrix \(\mathbf{M}\), and decoding succeeds if \(\mathbf{M}\) has full rank \(K\). The delivery probability is \[ R(\epsilon)=\sum_{n=K}^N \binom{N}{n}(1-\epsilon)^n\epsilon^{N-n}R_{K,n}(p). \] Because exact full-rank probabilities for sparse random matrices are intractable, the paper uses zero-row conditioning together with Stein–Chen Poisson approximation for minimal linear-dependence events. Writing \(\lambda=\sum_{\ell=2}^K\lambda_\ell\), it obtains the approximation \[ R_{K,n}(p)\approx (1-p^n)^K\exp(-\lambda), \] with \(\lambda_\ell=\binom{K}{\ell}\tilde\pi_\ell/(1-p^n)^\ell\) and \(\tilde\pi_\ell\) given by an inclusion–exclusion recursion. Monte Carlo results for \(K\le50\), \(q=2,2^4\), and \(p\in\{0.7,0.9\}\) show maximal absolute error below \(3\times 10^{-2}\) for binary fields and mean-squared error below \(10^{-3}\); for \(q=2^4\), the gap never exceeds \(1.1\times10^{-1}\), with MSE under \(4\times10^{-3}\) [1705.09473]. Experimental and simulation results in the other RLSC settings expose the central implementation trade-offs. In Nokia N8 smartphone experiments at \(\epsilon\approx 15\%\), low-rate MDS codes such as \(RS(255,g)\) are best for small \(g\le16\); systematic RL overtakes for intermediate \(g\approx16\ldots128\); and pure RL has the lowest overhead in theory at large \(g\), but on a 1 GHz ARM11 phone its cubic decoding cost causes dropped packets once \(g>64\). Net throughput and energy track inversely, because maximizing throughput reduces time-on-air and hence energy. In the multi-hop setting, simulations with two-hop parameters \(K=1\), \(N_2=3\), \(\Delta=2\), \(q_0=q_1=0.9\), Monte Carlo horizon \(T=10^5\ldots10^8\), and state caps \(m_0,m_1,m_2\in\{5,7,10,\dots\}\) verify the matrix analysis: the relative error falls below \(1\%\) for \(m_i=5\) and \(T\ge10^8\), and exceeds \(0.1\%\) accuracy if \(m_i\ge10\). In the typical regime \(\epsilon\in[0.01,0.18]\), large-field RLSCs achieve up to an order-of-magnitude lower error rates than adversarial DF schemes because the relay forwards “everything it has seen” in a pipelined manner rather than waiting for full decoding. In the stochastic single-hop setting, simulations show \(SRLSC