Bounds on the Minimum Distance of Goppa Codes

Hiren Maharaj · IEEE Transactions on Information Theory · 2008

A general upper bound on the minimum distance of Goppa codes is given. It is also shown how to choose divisors so that Goppa codes from fiber products of Kummer covers of the projective line have substantially improved lower bounds for the minimum distance compared to the usual Goppa bound.

Read the paper · More papers on PaperTik