Extended Irreducible Binary Sextic Goppa Codes

Publication date 17 February 2022

Abstract: Let

n (> 3)

be a prime number and

B b b F_{2^{n}}

a finite field of

2^{n}

elements. Let

L = B b b F_{2^{n}} c u p i n f t y

be the support set and

g (x)

an irreducible polynomial of degree

6

over

B b b F_{2^{n}}

. In this paper, we obtain an upper bound on the number of extended irreducible binary Goppa codes

G a m m a (L, g)

of degree

6

and length

2^{n} + 1

.

Cited in

(6)

This page was built for publication: Extended Irreducible Binary Sextic Goppa Codes