• DocumentCode
    1410293
  • Title

    Some new binary, quasi-cyclic codes

  • Author

    Heijnen, Petra ; Van Tilborg, Henk ; Verhoeff, Tom ; Weijs, Sander

  • Author_Institution
    Dept. of Math. & Comput. Sci., Eindhoven Univ. of Technol., Netherlands
  • Volume
    44
  • Issue
    5
  • fYear
    1998
  • fDate
    9/1/1998 12:00:00 AM
  • Firstpage
    1994
  • Lastpage
    1996
  • Abstract
    By means of local search techniques, five quasi-cyclic codes have been found that have a higher minimum distance than known binary linear codes. The new codes have parameters [102,17,37], [60,20,17], [84,21,27], [105,21,36], and [100,25,30]. Also, 39 other quasi-cyclic codes have been found that improve the parameter sets of previously known quasi-cyclic codes. Twenty-four of them give a new and easier description of binary linear codes with best known parameters
  • Keywords
    cyclic codes; linear codes; search problems; binary linear codes; local search techniques; minimum distance; parameter sets; quasi-cyclic codes; Character generation; Linear code; Mathematics; Polynomials; Search methods;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.705580
  • Filename
    705580