Article ID Journal Published Year Pages File Type
4582855 Finite Fields and Their Applications 2014 20 Pages PDF
Abstract

For a given support L∈Fqmn and a polynomial g∈Fqm[x]g∈Fqm[x] with no roots in FqmFqm, we prove equality between the q  -ary Goppa codes Γq(L,N(g))=Γq(L,N(g)/g)Γq(L,N(g))=Γq(L,N(g)/g) where N(g)N(g) denotes the norm of g  , that is gqm−1+⋯+q+1gqm−1+⋯+q+1. In particular, for m=2m=2, that is, for a quadratic extension, we get Γq(L,gq)=Γq(L,gq+1)Γq(L,gq)=Γq(L,gq+1). If g   has roots in FqmFqm, then we do not necessarily have equality and we prove that the difference of the dimensions of the two codes is bounded above by the number of distinct roots of g   in FqmFqm. These identities provide numerous code equivalences and improved designed parameters for some families of classical Goppa codes.

Related Topics
Physical Sciences and Engineering Mathematics Algebra and Number Theory
Authors
, , ,