Shift-register synthesis and BCH decoding
โ Scribed by Massey, J.
- Book ID
- 114633536
- Publisher
- IEEE
- Year
- 1969
- Tongue
- English
- Weight
- 984 KB
- Volume
- 15
- Category
- Article
- ISSN
- 0018-9448
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Generalized minimum-distance decoding (GMD) is realized by iterating simultaneous erasure-error correction while varying the erasure pattern. Simultaneous erasureerror correction can be considered as a constrained (in regard to the erasure location ideal) shift-register synthesis problem. Then, vari
In this paper. it is shown that the problem of generalized-minimum-distance (GMD) decoding of Reed-Solomon (RS) codes can be reduced to the problem of multisequence shift register synthesis, and a simple algorithm is presented that yields a solution for this problem by finding, for \(k=1,2, \ldots\)