• DocumentCode
    3663514
  • Title

    An upper bound on the minimum distance of LDPC codes over GF(q)

  • Author

    Alexey Frolov

  • Author_Institution
    Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia
  • fYear
    2015
  • fDate
    6/1/2015 12:00:00 AM
  • Firstpage
    2885
  • Lastpage
    2888
  • Abstract
    In [1] a syndrome counting based upper bound on the minimum distance of regular binary LDPC codes is given. In this paper we extend the bound to the case of irregular and generalized LDPC codes over GF(q). The comparison to the lower bound for LDPC codes over GF(q) and to the upper bound for non-binary codes is done. The new bound is shown to lie under the Gilbert-Varshamov bound at high rates.
  • Keywords
    "Parity check codes","Upper bound","Silicon","Random variables","Entropy","Binary codes","Bipartite graph"
  • Publisher
    ieee
  • Conference_Titel
    Information Theory (ISIT), 2015 IEEE International Symposium on
  • Electronic_ISBN
    2157-8117
  • Type

    conf

  • DOI
    10.1109/ISIT.2015.7282984
  • Filename
    7282984
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3663514