Fast Transform for Decoding Both Errors and Erasures of Reed-Solomon Codes
博士 === 義守大學 === 資訊工程學系博士班 === 94 === In this theis it is shown that a fast, prime factor, discrete Fourier transform (DFT) algorithm can be modified to compute Fourier-like transforms of long sequences of 2^m-1 points over GF(2^m) where 4<=m<=10. Using these transforms together with the Berlek...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2006
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/63753047139021191143 |