{
  "draft": "draft-ietf-rmt-bb-fec-rs-05",
  "doc_id": "RFC5510",
  "title": "Reed-Solomon Forward Error Correction (FEC) Schemes",
  "authors": [
    "J. Lacan",
    "V. Roca",
    "J. Peltotalo",
    "S. Peltotalo"
  ],
  "format": [
    "TEXT",
    "HTML"
  ],
  "page_count": "28",
  "pub_status": "PROPOSED STANDARD",
  "status": "PROPOSED STANDARD",
  "source": "Reliable Multicast Transport",
  "abstract": "This document describes a Fully-Specified Forward Error Correction (FEC) Scheme for the Reed-Solomon FEC codes over GF(2^^m), where m is in {2..16}, and its application to the reliable delivery of data objects on the packet erasure channel (i.e., a communication path where packets are either received without any corruption or discarded during transmission). This document also describes a Fully-Specified FEC Scheme for the special case of Reed-Solomon codes over GF(2^^8) when there is no encoding symbol group. Finally, in the context of the Under-Specified Small Block Systematic FEC Scheme (FEC Encoding ID 129), this document assigns an FEC Instance ID to the special case of Reed-Solomon codes over GF(2^^8).\n\n Reed-Solomon codes belong to the class of Maximum Distance Separable (MDS) codes, i.e., they enable a receiver to recover the k source symbols from any set of k received symbols. The schemes described here are compatible with the implementation from Luigi Rizzo. [STANDARDS-TRACK]",
  "pub_date": "April 2009",
  "keywords": [
    "maximum distance separable",
    "MDS"
  ],
  "obsoletes": [],
  "obsoleted_by": [],
  "updates": [],
  "updated_by": [],
  "see_also": [],
  "doi": "10.17487/RFC5510",
  "errata_url": null
}