𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficient Generalized Minimum-distance Decoders of Reed-Solomon Codes

✍ Scribed by Jiangli Zhu; Xinmiao Zhang

Publisher
Springer US
Year
2011
Tongue
English
Weight
384 KB
Volume
66
Category
Article
ISSN
1939-8018

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\)

Soft-decision decoding of Reed–Solomon c
Soft-decision decoding of Reed–Solomon codes
✍ Hideaki Nara; Hatsukazu Tanaka πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 202 KB

This paper proposes a new soft-decision decoding procedure for the ReedSolomon code. As the first step, the reliability function for the decoded estimation symbol is defined. To determine the estimated symbol and the reliability efficiently, an open trellis diagram is proposed from which the candida