From 90b244e6b0f152afd89298bc8142f222b73e2d5c Mon Sep 17 00:00:00 2001 From: wangyu- Date: Thu, 19 Oct 2017 10:51:15 -0700 Subject: [PATCH] Update README.md --- README.md | 13 ++++++++++++- 1 file changed, 12 insertions(+), 1 deletion(-) diff --git a/README.md b/README.md index de0bdd9..00209dc 100644 --- a/README.md +++ b/README.md @@ -27,7 +27,18 @@ For Windows and MacOS You can run UDPspeeder inside [this](https://github.com/wa # How does it work -UDPspeeder uses FEC(Forward Error Correction) to improve your connection's quality,at the cost of addtional bandwidth.The algorithm for FEC is Reed-Solomon. +UDPspeeder uses FEC(Forward Error Correction) to improve your connection's quality,at the cost of addtional bandwidth.The algorithm for FEC is called Reed-Solomon. + +### Reed-Solomon + +` +In coding theory, the Reed–Solomon code belongs to the class of non-binary cyclic error-correcting codes. The Reed–Solomon code is based on univariate polynomials over finite fields. +It is able to detect and correct multiple symbol errors. By adding t check symbols to the data, a Reed–Solomon code can detect any combination of up to t erroneous symbols, or correct up to ⌊t/2⌋ symbols. As an erasure code, it can correct up to t known erasures, or it can detect and correct combinations of errors and erasures. Reed–Solomon codes are also suitable as multiple-burst bit-error correcting codes, since a sequence of b + 1 consecutive bit errors can affect at most two symbols of size b. The choice of t is up to the designer of the code, and may be selected within wide limits. +` + +![](/images/en/rs.png) + +check wikipedia for more info, https://en.wikipedia.org/wiki/Reed–Solomon_error_correction # Getting Started