Binary quasi-cyclic Goppa codes (Q1580537)

From MaRDI portal
Revision as of 11:02, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Binary quasi-cyclic Goppa codes
scientific article

    Statements

    Binary quasi-cyclic Goppa codes (English)
    0 references
    0 references
    0 references
    2 February 2003
    0 references
    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.
    0 references
    linear codes
    0 references
    quasi-cycic Goppa codes
    0 references
    defining polynomial
    0 references
    minimum distance bound
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references