• DocumentCode
    805223
  • Title

    More results on the weight enumerator of product codes

  • Author

    Tolhuizen, Ludo M G M

  • Author_Institution
    Philips Res. Lab., Eindhoven, Netherlands
  • Volume
    48
  • Issue
    9
  • fYear
    2002
  • fDate
    9/1/2002 12:00:00 AM
  • Firstpage
    2573
  • Lastpage
    2577
  • Abstract
    We consider the product code Cp of q-ary linear codes with minimum distances dc and dr. The words in Cp of weight less than drdc+max(dr┌(dc/g)┐,dc┌(dr/q)┐) are characterized, and their number is expressed in the number of low-weight words of the constituent codes. For binary product codes, we give an upper bound on the number of words in Cp of weightless than min(dr(dc+┌(dc/2)┐+1)), dc(dr+┌(dr/2)┐+1) that is met with equality if Cc and Cr are (extended) perfect codes.
  • Keywords
    binary codes; linear codes; binary product codes; constituent codes; low-weight words; product codes; q-ary linear codes; upper bound; weight enumerator; Information theory; Linear code; Product codes; Upper bound;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

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