New Identities Relating Wild Goppa Codes
Abstract
For a given support L ∈ Fqmn and a polynomial g∈ Fqm[x] with no roots in Fqm, we prove equality between the q-ary Goppa codes q(L,N(g)) = q(L,N(g)/g) where N(g) denotes the norm of g, that is gqm-1+·s +q+1. In particular, for m=2, that is, for a quadratic extension, we get q(L,gq) = q(L,gq+1). If g has roots in Fqm, 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 Fqm. These identities provide numerous code equivalences and improved designed parameters for some families of classical Goppa codes.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.