Reed-Solomon Forward Error Correction (FEC) Schemes for FECFRAME

Document Type Expired Internet-Draft (individual)
Authors Vincent Roca  , Mathieu Cunche  , Jerome Lacan  , Amine Bouabdallah  , Kazuhisa Matsuzono 
Last updated 2010-07-12 (latest revision 2010-03-08)
Stream (None)
Expired & archived
pdf htmlized bibtex
Additional Resources
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


This document describes two fully-specified simple FEC schemes for Reed-Solomon codes that can be used to protect 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. The first scheme is for Reed-Solomon codes over GF(2^^m), with 2 <= m <= 16 and arbitrary packet flows. The second scheme is similar to the first scheme, with the exception that it is restricted to a single sequenced flow.


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.)