Error-Erasure Decoding for Reed-Solomon Codes Based on Welch-Berlekamp Algorithm
碩士 === 國立臺北大學 === 通訊工程研究所 === 99 === Reed-Solomon codes are well-known to have good error-correcting capabilities in communication system and data storage. The decoding procedure of Reed-Solomon codes has four steps: syndrome computation, solving key equation, finding roots of error locator polynomi...
Main Authors: | Po-Ting Lin, 林柏廷 |
---|---|
Other Authors: | Yunghsiang Sam Han |
Format: | Others |
Language: | en_US |
Published: |
2011
|
Online Access: | http://ndltd.ncl.edu.tw/handle/29041312717773038555 |
Similar Items
-
Modified Welch Berlekamp Algorithm to Decode Reed Solomon Codes
by: Mahmudi Ali, et al.
Published: (2018-01-01) -
The Original View of Reed-Solomon Coding and the Welch-Berlekamp Decoding Algorithm
by: Mann, Sarah Edge
Published: (2013) -
Studing Closed Solution of Berlekamp's Algorithm for Fast Decoding of Reed-Solomon Codes
by: Leu, Jun Poe, et al.
Published: (1994) -
Decoding BCH Codes Based on Welch-Berlekamp Algorithm
by: Tso Shen, et al.
Published: (2010) -
Fast Transform for Decoding Both Errors and Erasures of Reed-Solomon Codes
by: Pei-ding Chen, et al.
Published: (2006)