RLNC vs Reed-Solomon in Satellite Channels: Crossover Analysis and the Bridging Property
Compares random linear network coding and Reed-Solomon codes on satellite links and finds where each wins.
Abstract
Satellite communication systems are increasingly relied upon for connectivity in remote areas and are expected to play a pivotal role in 6G networks, operating under high round-trip times and packet loss where forward error correction is essential. This work evaluates Reed-Solomon (RS) coding, Random Linear Network Coding (RLNC), and a combined RS+RLNC hybrid over a three-hop satellite channel whose loss statistics are derived from orbital geometry and link-budget calculations rather than assumed, comparing RS and RLNC at matched code rates of 0.800. The central finding is the \emph{bridging property} of RLNC: every RS code rate collapses above a crossover threshold $p^$, while RLNC operates continuously through all failure regions with overhead growing as $1/(1-p)$. At rate~0.800, $p^ \approx 0.21$. Under the derived satcom channel with mean burst duration 166
minutes, RS$(255,204)$ is impractical despite an average loss rate of 1%, while RLNC requires 15.5Mbit to recover all 1000 packets. An RS+RLNC hybrid reduces overhead by 19% relative to pure RLNC at BER$=10^{-3}$. To the authors' knowledge, this is the first analytical derivation of the rate-normalised crossover $p^*$ between RS and RLNC and the first experimental confirmation of the bridging property under a physically derived satellite channel model.