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

A generalized Euclidean algorithm for multisequence shift-register synthesis

โœ Scribed by Feng, G.-L.; Tzeng, K.K.

Book ID
114539917
Publisher
IEEE
Year
1989
Tongue
English
Weight
868 KB
Volume
35
Category
Article
ISSN
0018-9448

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On Multisequence Shift Register Synthesi
On Multisequence Shift Register Synthesis and Generalized-Minimum-Distance Decoding of Reed-Solomon Codes
โœ 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\)