The Sliding Window Random Linear Code (RLC) Forward Erasure Correction (FEC) Scheme for FECFRAME
draft-roca-tsvwg-rlc-fec-scheme-01

Document Type Replaced Internet-Draft (individual)
Last updated 2017-06-27
Replaced by draft-ietf-tsvwg-rlc-fec-scheme
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 Replaced by draft-ietf-tsvwg-rlc-fec-scheme
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-roca-tsvwg-rlc-fec-scheme-01.txt

Abstract

This document describes a fully-specified FEC scheme for the Sliding Window Random Linear Codes (RLC) over GF(2^^m), where m equals 1 (binary case), 4 or 8, that can be used to protect arbitrary media streams along the lines defined by FECFRAME extended to sliding window codes. These sliding window FEC codes rely on an encoding window that slides over the source symbols, generating new repair symbols whenever needed. Compared to block FEC codes, these sliding window FEC codes offer key advantages with real-time flows in terms of reduced FEC-related latency while often providing improved erasure recovery capabilities.

Authors

Vincent Roca (vincent.roca@inria.fr)

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