• DocumentCode
    1018263
  • Title

    Twelve good rate (m-r)/pm quasi-cyclic codes

  • Author

    Gulliver, T. Aaron ; Bhargava, Vijay K.

  • Author_Institution
    Dept. of Syst. & Comput. Eng., Carleton Univ., Ottawa, Ont., Canada
  • Volume
    39
  • Issue
    5
  • fYear
    1993
  • fDate
    9/1/1993 12:00:00 AM
  • Firstpage
    1750
  • Lastpage
    1751
  • Abstract
    Twelve new quasi-cyclic (QC) codes are presented which improve the bounds on the best known binary linear codes. They are rate (m-r)/pm, r>1, codes constructed by deleting r rows from the circulant matrices of rate m/pm QC codes, based on the factors of xm-1. Heuristic combinatorial optimization was used to find these codes
  • Keywords
    cyclic codes; matrix algebra; optimisation; binary linear codes; bounds; circulant matrices; heuristic combinatorial optimization; quasicyclic codes; Linear code; Upper bound;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.259670
  • Filename
    259670
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1018263