• DocumentCode
    829852
  • Title

    New binary one-generator quasi-cyclic codes

  • Author

    Daskalov, Rumen ; Hristov, Plamen

  • Author_Institution
    Dept. of Math., Tech. Univ. of Gabrovo, Bulgaria
  • Volume
    49
  • Issue
    11
  • fYear
    2003
  • Firstpage
    3001
  • Lastpage
    3005
  • Abstract
    Sixteen new binary quasi-cyclic linear codes improving the best known lower bounds on minimum distance in Brouwer´s tables are constructed. The parameters of these codes are [102, 26, 32], [102, 27, 30], [142, 35, 40], [142, 36, 38] [146, 36, 40], [170, 16, 72], [170, 20, 66], [170, 33, 52] [170, 36, 50], [178, 33, 56], [178, 34, 54], [182, 27, 64] [182, 36, 56], [186, 17, 76], [210, 23, 80], [254, 22, 102] Sixty cyclic and thirty quasi-cyclic codes, which attain the respective bounds in Brouwer´s table and are not included in Chen´s table are presented as well.
  • Keywords
    binary codes; cyclic codes; Brouwer tables; Chen table; binary codes; linear codes; lower bounds; minimum distance; one-generator quasi-cyclic codes; Algebra; Galois fields; Hamming distance; Linear code; Mathematics; Polynomials; Vectors;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.2003.819337
  • Filename
    1246024