@techreport{roca-fecframe-rs-03,
    number =    {draft-roca-fecframe-rs-03},
    type =      {Internet-Draft},
    institution =   {Internet Engineering Task Force},
    publisher = {Internet Engineering Task Force},
    note =      {Work in Progress},
    url =       {https://datatracker.ietf.org/doc/draft-roca-fecframe-rs/03/},
    author =    {Vincent Roca and Mathieu Cunche and Jerome Lacan and Amine Bouabdallah and Kazuhisa Matsuzono},
    title =     {{Reed-Solomon Forward Error Correction (FEC) Schemes for FECFRAME}},
    pagetotal = 20,
    year =      2010,
    month =     jul,
    day =       12,
    abstract =  {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\textasciicircum{}\textasciicircum{}m), with 2 \textless{}= m \textless{}= 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.},
}