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
โฆ LIBER โฆ
The number of inequivalent irreducible Goppa codes
โ Scribed by Patrick Fitzpatrick; John A. Ryan
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 412 KB
- Volume
- 6
- Category
- Article
- ISSN
- 1571-0653
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
On the Cyclicity of Goppa Codes, Parity-
โ
Thierry P. Berger
๐
Article
๐
2000
๐
Elsevier Science
๐
English
โ 231 KB
The Asymptotic Number of Inequivalent Bi
โ
Marcel Wild
๐
Article
๐
2000
๐
Elsevier Science
๐
English
โ 139 KB
The asymptotic value as nPR of the number b(n) of inequivalent binary n-codes is determined. It was long known that b(n) also gives the number of nonisomorphic binary n-matroids.
Further results about the cyclicity of g
โ
K.K. Tzeng; G.L. Feng
๐
Article
๐
1985
๐
Elsevier Science
๐
English
โ 521 KB
New Bounds on the Distance Distribution
โ
Simon Litsyn; Sarit Zur
๐
Article
๐
2002
๐
Elsevier Science
๐
English
โ 169 KB
We derive new estimates for the error term in the binomial approximation to the distance distribution of extended Goppa codes. This is an improvement on the earlier bounds by Vladuts and Skorobogatov, and Levy and Litsyn.
On the weight hierarchy of irreducible c
โ
Marcel van der Vlugt
๐
Article
๐
1995
๐
Elsevier Science
๐
English
โ 376 KB
The number of indecomposable codes
โ
Kenneth P Bogart
๐
Article
๐
1977
๐
Elsevier Science
๐
English
โ 385 KB