๐”– Bobbio Scriptorium
โœฆ   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

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

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.

The number of indecomposable codes
โœ Kenneth P Bogart ๐Ÿ“‚ Article ๐Ÿ“… 1977 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 385 KB