Some Results on Reed-Solomon Codes Using Fast Fourier Transforms
碩士 === 國立臺灣大學 === 電信工程學研究所 === 107 === In [1], a novel polynomial basis over finite fields of characteristic two was proposed, such that the fast Fourier transform can be employed in the computation over binary extension finite fields. Because traditional Reed-Solomon codes have high complexity in t...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2019
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/8gyr48 |