Binary quasi-cyclic Goppa codes (Q1580537): Difference between revisions

A class of quasi-cycic Goppa codes containing irreducibles codes, and partially split ones, is defined. A necessary and sufficient condition for a Goppa code to be quasi-cyclic is given. One more sufficient condition is derived on the defining polynomial of the Goppa code. The authors further give a partial converse that is only available for Goppa codes reaching their theoretical minimum distance bound. Finally, quasi-cyclic Goppa codes with designed dimension equal to the true one are found. The minimum distance bound is however not improved, but, by extending any ``fundamental'' split quasi-cyclic Goppa code, one can reach the bound on the minimum distance.