Binary Goppa code

In mathematics and computer science, the binary Goppa code is an error-correcting code that belongs to the class of general Goppa codes originally…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2001

We present a new family of binary codes derived from the family of classical Goppa codes. We generalize properties of Goppa codes…

2000

We obtain here a necessary and sufficient condition for a certain class of binary Goppa code to be quasi-cyclic. We also give…

1998

We study Goppa codes, /spl Gamma/(L,g), defined by the polynomial g(z)=a(z)TrF/sub p/ms:F/sub p/s(b(z)). It is shown that the…

1998

A new bound for the dimension of binary Goppa codes belonging to a specific subclass is given. This bound improves the well-known…

1997

We discuss parameters of Goppa (1970) codes, such as minimum distance, covering radius, distance distribution, and generalized…

1987

Based on a finite Fourier transform of codewords over the finite field GF (q^{m}) , some basic properties of the class of Goppa…

1986

In this paper the weight distribution of binary Goppa codes with location set GF (2m) and irreducible quadratic Goppa polynomial…

1984

A [55, 16, 19] binary Goppa code and some related codes are described. These codes are found to contain more codewords than any…

1984

1977

It is shown that i) erasures-and-errors decoding of Goppa codes can be done using O(n \log^{2} n) arithmetic operations, ii) long…