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
โฆ LIBER โฆ
Skew-Feedback Shift-Register Synthesis and Decoding Interleaved Gabidulin Codes
โ Scribed by Sidorenko, V.; Lan Jiang; Bossert, M.
- Book ID
- 114642487
- Publisher
- IEEE
- Year
- 2011
- Tongue
- English
- Weight
- 331 KB
- Volume
- 57
- Category
- Article
- ISSN
- 0018-9448
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Constrained shift-register synthesis: Fa
โ
Yutaka Kobayashi; Masaya Fujisawa; Shojiro Sakata
๐
Article
๐
2000
๐
John Wiley and Sons
๐
English
โ 251 KB
On Multisequence Shift Register Synthesi
โ
N. Kamiya
๐
Article
๐
1995
๐
Elsevier Science
๐
English
โ 618 KB
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\)