Random Linear Network Coding (RLNC): Background and Practical Considerations
draft-heide-nwcrg-rlnc-background-00

Document Type Expired Internet-Draft (individual)
Last updated 2019-08-15 (latest revision 2019-02-11)
Stream (None)
Intended RFC status (None)
Formats
Expired & archived
plain text pdf html bibtex
Stream Stream state (No stream defined)
Consensus Boilerplate Unknown
RFC Editor Note (None)
IESG IESG state Expired
Telechat date
Responsible AD (None)
Send notices to (None)

This Internet-Draft is no longer active. A copy of the expired Internet-Draft can be found at
https://www.ietf.org/archive/id/draft-heide-nwcrg-rlnc-background-00.txt

Abstract

This document describes the use of Random Linear Network Coding (RLNC) schemes for reliable data transport. Both block and sliding window RLNC code implementations are described. By providing erasure correction using randomly generated repair symbols, such RLNC-based schemes offer advantages in accommodating varying frame sizes and dynamically changing connections, reducing the need for feedback, and lowering the amount of state information needed at the sender and receiver. The practical considerations' section identifies RLNC- encoded symbol representation as a valuable target for standardization.

Authors

Janus Heide (janus@steinwurf.com)
Shirley Shi (xshi@alum.mit.edu)
Kerim Fouli (fouli@codeontechnologies.com)
Muriel Medard (muriel.medard@codeontechnologies.com)
Vince Chook (vince.chook@inmarsat.com)

(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)