𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficient decoding of Reed-Solomon codes beyond half the minimum distance

✍ Scribed by Roth, R.M.; Ruckenstein, G.

Book ID
114541508
Publisher
IEEE
Year
2000
Tongue
English
Weight
565 KB
Volume
46
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\)