English  |  正體中文  |  简体中文  |  Items with full text/Total items : 54367/62174 (87%)
Visitors : 13392230      Online Users : 325
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTHU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    National Tsing Hua University Institutional Repository > 電機資訊學院 > 電機工程學系 > 會議論文  >  On codes constructed by generalized Kronecker product

    Please use this identifier to cite or link to this item: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/68304

    Title: On codes constructed by generalized Kronecker product
    Authors: W.-Y. Chen;C.-C. Lu
    教師: 呂忠津
    Date: 2007
    Publisher: Institute of Electrical and Electronics Engineers
    Relation: 2007 IEEE International Symposium on Information Theory, 1236-40, 2007
    Keywords: generalized Kronecker product
    Abstract: In this paper, we apply generalized Kronecker product recursively to construct low-density parity-check (LDPC) codes with arbitrarily large girth. The parity check matrices of these codes are block matrices consisting of circulant permutation matrices, thus may benefit from efficient encoding. It turns out that the LU(m, q) codes proposed in the literature is a special case of this construction for prime q. Connectivity of Tanner graphs of these codes are investigated.
    Relation Link: http://www.ieee.org/
    URI: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/68304
    Appears in Collections:[電機工程學系] 會議論文

    Files in This Item:

    File Description SizeFormat


    SFX Query


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback