<?xml version="1.0" encoding="UTF-8"?>
<reference anchor="I-D.roca-fecframe-simple-rs" target="https://datatracker.ietf.org/doc/html/draft-roca-fecframe-simple-rs-01">
   <front>
      <title>Simple Reed-Solomon Forward Error Correction (FEC) Scheme for FECFRAME</title>
      <author initials="V." surname="Roca" fullname="Vincent Roca">
         <organization>INRIA</organization>
      </author>
      <author initials="M." surname="Cunche" fullname="Mathieu Cunche">
         <organization>NICTA</organization>
      </author>
      <author initials="J." surname="Lacan" fullname="Jerome Lacan">
         <organization>ISAE/LAAS-CNRS</organization>
      </author>
      <author initials="A." surname="Bouabdallah" fullname="Amine Bouabdallah">
         <organization>ISAE/LAAS-CNRS</organization>
      </author>
      <author initials="K." surname="Matsuzono" fullname="Kazuhisa Matsuzono">
         <organization>Keio University</organization>
      </author>
      <date month="October" day="22" year="2010" />
      <abstract>
	 <t>This document describes a fully-specified simple FEC scheme for Reed-
Solomon codes over GF(2^^m), with 2 &lt;= m &lt;= 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.
	 </t>
      </abstract>
   </front>
   <seriesInfo name="Internet-Draft" value="draft-roca-fecframe-simple-rs-01" />
   
</reference>
