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.
On the study of generic cyclic redundancy code
โ Scribed by John C. Chan; Shien-Tai Pan; D.F. Wong
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 623 KB
- Volume
- 34
- Category
- Article
- ISSN
- 0026-2714
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Classical Goppa codes are a special case of Alternant codes. First we prove that the parity-check subcodes of Goppa codes and the extended Goppa codes are both Alternant codes. Before this paper, all known cyclic Goppa codes were some particular BCH codes. Many families of Goppa codes with a cyclic
The weight distribution is an important parameter that determines the performance of a code. The minimum distance and the number of corresponding codes that can be derived from the weight distribution, greatly affect the performance of the code. The decoding error probability and other performance m