• DocumentCode
    836576
  • Title

    Determination of the Best CRC Codes with up to 10-Bit Redundancy

  • Author

    Baicheva, Tsonka S.

  • Author_Institution
    Inst. of Math. & Inf., Bulgarian Acad. of Sci., Veliko Tarnovo
  • Volume
    56
  • Issue
    8
  • fYear
    2008
  • fDate
    8/1/2008 12:00:00 AM
  • Firstpage
    1214
  • Lastpage
    1220
  • Abstract
    All binary polynomials of degree up to 10 which are suitable to be used as generator polynomials of CRC codes are classified and all the necessary data for the evaluation of the error control performance of the CRC codes generated by the classified polynomials is calculated. A procedure, based on the computed data, for choosing the best CRC code is suggested.
  • Keywords
    cyclic redundancy check codes; polynomials; binary polynomials; cyclic redundancy check codes; generator polynomials; word length 10 bit; Cyclic redundancy check; Decoding; Encoding; Error correction; Error probability; Linear code; Mathematics; Parity check codes; Protection; Vectors;
  • fLanguage
    English
  • Journal_Title
    Communications, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0090-6778
  • Type

    jour

  • DOI
    10.1109/TCOMM.2008.070033
  • Filename
    4600169
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=836576