Decoding Algebraic Geometry Codes by a Key Equation
✍ Scribed by J.I. Farrán
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 142 KB
- Volume
- 6
- Category
- Article
- ISSN
- 1071-5797
No coin nor oath required. For personal study only.
✦ Synopsis
A new e!ective decoding algorithm is presented for arbitrary algebraic-geometric codes on the basis of solving a generalized key equation with the majority coset scheme of Duursma. It is an improvement of Ehrhard's algorithm, since the method corrects up to half of the Goppa distance with complexity order O(n), and with no further assumption on the degree of the divisor G.
📜 SIMILAR VOLUMES
The case when the modulation index is 0.5 in continuous phase frequency shift keying (CPFSK) is called fast frequency shift keying (FFSK). In this paper, a trellis-coded multidimensional modulation scheme using FFSK is proposed. In implementing a multidimensional modulation system, the complexity of
## 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