Systematic Rate-independent Reed-Solomon (SR-RS) Erasure Correction Scheme
draft-shen-rmt-bb-fec-srrscode-00
| Document | Type |
This is an older version of an Internet-Draft whose latest revision state is "Expired".
Expired & archived
|
|
|---|---|---|---|
| Authors | BZ Shen , Erik Stauffer , Kamlesh Rath | ||
| Last updated | 2012-11-18 (Latest revision 2012-05-17) | ||
| RFC stream | Internet Engineering Task Force (IETF) | ||
| Formats | |||
| Stream | WG state | (None) | |
| Document shepherd | (None) | ||
| IESG | IESG state | Expired | |
| Consensus boilerplate | Unknown | ||
| Telechat date | (None) | ||
| Responsible AD | (None) | ||
| Send notices to | (None) |
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
Abstract
This document specifies a systematic rate-independent Reed-Solomon (SR-RS) Erasure correction scheme. The two properties, systematic and rate-independent, are fulfilled by Lagrange polynomial interpolation. When the number of output symbols is fixed this scheme essentially generates a Reed-Solomon (RS) code. Therefore, based on the MDS (maximum distance separable) property of RS code, this erasure correction scheme is optimal (ideal). Also in this document, a two-step fast recovering (decoding) algorithm using fast Walsh-Hadamard transform is presented for the proposed erasure correction scheme. This algorithm achieves the time complexity O(n*log2(n)), or linear if penalization implementation, such as multi-core processor, is allowed.
Authors
BZ Shen
Erik Stauffer
Kamlesh Rath
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)