Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

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

Highly Cited

2011

Highly Cited

2011

This paper presents a Patterson-style list-decoding algorithm for classical irreducible binary Goppa codes. The algorithm… Expand

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… Expand

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… Expand

Is this relevant?

1995

1995

A subclass of binary Goppa codes specified by a separable polynomial G(x)=x/sup t/+A and a subset L of elements of GF(2/sup m… Expand

Is this relevant?

Highly Cited

1990

Highly Cited

1990

Starting from results on elliptic curves and Kloosterman sums over the finite field GE(2/sup t/), the authors determine the… Expand

Is this relevant?

1990

1990

By applying a result from algebraic geometry due to E. Bombieri (Amer. J. Math., vol.88, p.71-105, 1966), the true dimension of… Expand

Is this relevant?

Highly Cited

1987

Highly Cited

1987

It is shown that the algebraic method for decoding three-error-correcting BCH codes is also applicable to complete decoding of… Expand

Is this relevant?

1979

1979

It is known that extended Goppa cedes are invariant under the group of transformations Z \rightarrow (A Z + B ) / ( CZ + D… Expand

Is this relevant?

1973

1973

The class of codes introduced by Goppa [1]-[3] includes the BCH codes as a proper subset. It also includes a large subset of… Expand

Is this relevant?

Highly Cited

1973

Highly Cited

1973

Goppa described a new class of linear noncyclic error-correcting codes in [1] and [2]. This paper is a summary of Goppa's work… Expand

Is this relevant?