• DocumentCode
    11627
  • Title

    Counting Extended Irreducible Binary Quartic Goppa Codes of Length 2^{n}+1

  • Author

    Ryan, John A.

  • Author_Institution
    Dept. of Math., Mzuzu Univ., Mzuzu, Malawi
  • Volume
    61
  • Issue
    3
  • fYear
    2015
  • fDate
    Mar-15
  • Firstpage
    1174
  • Lastpage
    1178
  • Abstract
    We produce an upper bound on the number of extended irreducible binary quartic Goppa codes of length 2n+1, where n > 3 is a prime number.
  • Keywords
    Goppa codes; computational complexity; counting extended irreducible binary quartic Goppa codes; length 2n+1; prime number; Educational institutions; Mathematical model; Orbits; Polynomials; Upper bound; Classical Goppa codes; equivalent codes; extended codes; irreducible Goppa codes; rreducible Goppa codes;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.2015.2389246
  • Filename
    7005532
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=11627