New Classes of Cyclic Extended Goppa Codes


In this correspondence, we give a condition for a “classical” Goppa code to have a cyclic extension. This condition follows from properties of the semilinear automorphism group of the corresponding Generalized Reed–Solomon codes. Using this condition, we can construct not only all the known Goppa codes with a cyclic extension, but also new families. 
DOI: 10.1109/18.761281


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics