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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
This paper presents a Patterson-style list-decoding algorithm for classical irreducible binary Goppa codes. The algorithm… (More)
Is this relevant?
Highly Cited
2009
Highly Cited
2009
The classical McEliece cryptosystem is built upon the class of Goppa codes, which remains secure to this date in contrast to many… (More)
  • table 2
  • table 3
  • table 4
  • table 5
  • table 6
Is this relevant?
2008
2008
It is shown that subclasses of separable binary Goppa codes, <i>Gamma(L</i>,<i>G</i>) - codes, with <i>L</i>={alpha isin GF(2<sup… (More)
  • table I
  • figure 1
  • table II
Is this relevant?
2001
2001
We present a new family of binary codes derived from the family of classical Goppa codes. We generalize properties of Goppa codes… (More)
  • table 1
  • table 2
Is this relevant?
1997
1997
We discuss parameters of Goppa codes, such as minimum distance, covering radius, distance distribution, and generalized Hamming… (More)
Is this relevant?
Highly Cited
1990
Highly Cited
1990
-Starting from results on elliptic curves and Kloosterman sums over the finite field GE(2'). we determine the weights of the… (More)
Is this relevant?
1990
1990
J . Bruck and J. Sanz. “A study on neural nctworks, Iiiteriiurroiiul Jouriiol of Irirelligeiir Svsrenis. vol. 3. pp. 59-75. I Y X… (More)
Is this relevant?
Highly Cited
1975
Highly Cited
1975
An interesting class of l inear error-correcting codes has been found by Goppa [3], [4]. This paper presents algebraic decoding… (More)
Is this relevant?
Highly Cited
1975
Highly Cited
1975
A simple approach to recent generalizations of BCH and Goppa codes, viewed as subfield subcodes of modified Reed-Solomon codes… (More)
Is this relevant?
1973
1973
-By shortening certain binary primitive BCH codes, we derive a number of linear error-correcting codes with minimum distances… (More)
Is this relevant?