Network Coding Approaches for Distributed Computation over Lossy Wireless Networks https://pmc.ncbi.nlm.nih.gov/articles/PMC10047255
B. Fan, B. Tang, Z. Qu, and B. Ye, “Network Coding Approaches for Distributed Computation over Lossy Wireless Networks,” Entropy, vol. 25, no. 3, p. 428, Feb. 2023, doi: 10.3390/e25030428.
Ho, T.; Médard, M.; Koetter, R.; Karger, D.R.; Effros, M.; Shi, J.; Leong, B. A random linear network coding approach to multicast. IEEE Trans. Inf. Theory 2006, 52, 4413–4430. https://dl.acm.org/doi/10.1109/TIT.2006.881746
R. Ahlswede, Ning Cai, S.-Y. R. Li, and R. W. Yeung, “Network information flow,” IEEE Trans. Inform. Theory, vol. 46, no. 4, pp. 1204–1216, Jul. 2000, doi: 10.1109/18.850663.
https://mae.engr.ucdavis.edu/dsouza/Network_Information_Flow.pdf
Random Linear Network Coding (RLNC) is a distributed coding scheme where network nodes generate output packets by computing linear combinations of input packets using randomly chosen coefficients from a finite field.
It solves a critical coordination problem in network coding: In complex, dynamic networks (like wireless mesh or ad-hoc networks), it is impossible for a central controller to tell every node exactly which packets to mix. RLNC allows nodes to make these decisions locally and randomly, yet still guarantees that the receiver can decode the data with high probability.
