In the GC-LDPC code, the replacement set plays an important role in the construction of the parity-check matrix H. Considering BIBDs with λ = 1, a replacement set can be structured which satisfies RC-constraint. The parity-check matrix H of the GC-LDPC code can be straightforwardly constructed from the replacement set. Simulation results show that the performance of BIBDs based CN-GC-LDPC code surpasses finite field based CN- GC-LDPC code.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Construction of Replacement Set in the GC-LDPC Codes Based on BIBDs


    Beteiligte:
    Zhou, Wei (Autor:in) / Cheng, Lei (Autor:in) / Zhang, Lijun (Autor:in)


    Erscheinungsdatum :

    2019-04-01


    Format / Umfang :

    138209 byte





    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Full diversity random LDPC codes

    Duyck, D. / Boutros, J. J. / Moeneclaey, M. | IEEE | 2011


    Low-Complexity Concatenated LDPC-Staircase Codes

    Barakatain, M. / Kschischang, F. R. | British Library Online Contents | 2018


    Low-Latency Decoding of EG LDPC Codes

    Zhang, J. / Yedidia, J. S. / Fossorier, M. | British Library Online Contents | 2007


    Lower Error Floors for NASA LDPC Codes

    Hamkins, Jon | NTRS | 2011


    Noise-Assisted List Decoding for 5G LDPC Codes

    Gao, Jian / Wang, Hao / Tian, Kuangda | IEEE | 2022