Improving the minimum distance bound of trace Goppa codes

Abstract: In this article we prove that a class of Goppa codes whose Goppa polynomial is of the form

g (x) = x + x^{q} + c d o t s + x^{q^{m - 1}}

where

m g e q 3

(i.e.

g (x)

is a trace polynomial from a field extension of degree

m g e q 3

) has a better minimum distance than what the Goppa bound

d g e q 2 d e g (g (x)) + 1

implies. Our improvement is based on finding another Goppa polynomial

h

such that

C (L, g) = C (M, h)

but

d e g (h) > d e g (g)

. This is a significant improvement over Trace Goppa codes over quadratic field extensions (i.e. the case

m = 2

), as the Goppa bound for the quadratic case is sharp.

Recommendations

Cites work

Cited in

(4)

This page was built for publication: Improving the minimum distance bound of trace Goppa codes