| タイトル | The algebraic decoding of the (41, 21, 9) quadratic residue code |
| 著者（英） | Chen, Xuemin; Truong, T. K.; Yin, Xiaowei; Reed, Irving S. |
| 著者所属（英） | Jet Propulsion Lab., California Inst. of Tech. |
| 発行日 | 1992-05-01 |
| 言語 | eng |
| 内容記述 | A new algebraic approach for decoding the quadratic residue (QR) codes, in particular the (41, 21, 9) QR code is presented. The key ideas behind this decoding technique are a systematic application of the Sylvester resultant method to the Newton identities associated with the code syndromes to find the error-locator polynomial, and next a method for determining error locations by solving certain quadratic, cubic and quartic equations over GF(2 exp m) in a new way which uses Zech's logarithms for the arithmetic. The algorithms developed here are suitable for implementation in a programmable microprocessor or special-purpose VLSI chip. It is expected that the algebraic methods developed here can apply generally to other codes such as the BCH and Reed-Solomon codes. |
| NASA分類 | CYBERNETICS |
| レポートNO | 92A46019 |
| 権利 | Copyright |
| URI | https://repository.exst.jaxa.jp/dspace/handle/a-is/325844 |
|
