๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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


Constrained shift-register synthesis: Fa
โœ Yutaka Kobayashi; Masaya Fujisawa; Shojiro Sakata ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 251 KB

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

Linearized Shift-Register Synthesis
โœ Sidorenko, V.; Richter, G.; Bossert, M. ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› IEEE ๐ŸŒ English โš– 189 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\)

Shift Register Synthesis (Modulo m )
โœ Reeds, J. A.; Sloane, N. J. A. ๐Ÿ“‚ Article ๐Ÿ“… 1985 ๐Ÿ› Society for Industrial and Applied Mathematics ๐ŸŒ English โš– 805 KB
Errors-and-erasures decoding of BCH code
โœ Fitzpatrick, P. ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› The Institution of Electrical Engineers ๐ŸŒ English โš– 247 KB