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\)
Generalized threshold decoding of cyclic codes
β Scribed by Gui-Liang Feng
- Publisher
- Elsevier Science
- Year
- 1985
- Tongue
- English
- Weight
- 413 KB
- Volume
- 56
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
In this paper we discuss the generalized threshold decoding of cyclic codes. It is a generalization for the threshold decoding and the modified error-trapping decoding, and it combines their advantages.
On the other hand, it is more efficient than the permutation decoding.
π SIMILAR VOLUMES
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
## Abstract Aimed at bridging the gap between the maximum likelihood and the suboptimal decoding schemes for short or medium LDPC codes, a generalised ordered statistic decoding (OSD), in the form of syndrome decoding, is presented in the paper. The OSD is invoked once when a nonzero decoding syndr
## Abstract Cyclic codes are often used for the purpose of correcting burst errors in digital transmission and recording systems. Since the implementations of the encoding and syndrome calculations of these codes are simple, these codes have superior properties from a practical perspective. In this