Simple Reed-Solomon Forward Error Correction (FEC) Scheme for FECFRAME

Document Type Expired Internet-Draft (individual)
Last updated 2010-10-22
Stream (None)
Intended RFC status (None)
Expired & archived
plain text pdf html bibtex
Stream Stream state (No stream defined)
Document shepherd No shepherd assigned
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


This document describes a fully-specified simple FEC scheme for Reed- Solomon codes over GF(2^^m), with 2 <= m <= 16, that can be used to protect arbitrary media streams along the lines defined by the FECFRAME framework. Reed-Solomon codes belong to the class of Maximum Distance Separable (MDS) codes which means they offer optimal protection against packet erasures. They are also systematic codes, which means that the source symbols are part of the encoding symbols. The price to pay is a limit on the maximum source block size, on the maximum number of encoding symbols, and a computational complexity higher than that of LDPC codes for instance.


Vincent Roca (
Mathieu Cunche (
Jerome Lacan (
Amine Bouabdallah (
Kazuhisa Matsuzono (

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