In this paper, we present explicit code constructions for a family of (n,k,δ) convolutional codes with optimum distance profiles. The family of convolutional codes is obtained from sets of jointly superregular matrices. For the case of finite decoder memory, we evaluate the performance of the constructed codes in terms of both symbol loss probability and symbol delay. We then present a combinatorial method to calculate the exact symbol loss probability and symbol delay for each symbol individually. We compare the symbol loss probability for two specific systematic convolutional codes for the cases where the sink has infinite or finite memory. Finally, we compare the performance of our convolutional codes with optimum distance profile and random based convolutional codes.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    On Superregular Matrices and Convolutional Codes with Finite Decoder Memory


    Beteiligte:
    Hansen, Jonas (Autor:in) / Ostergaard, Jan (Autor:in) / Kudahl, Johnny (Autor:in) / Madsen, John H. (Autor:in)


    Erscheinungsdatum :

    01.06.2018


    Format / Umfang :

    346803 byte





    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Finite Length Non-binary Raptor Codes under Ordered Statistics Decoder

    Wang, Fei / Jiao, Jian / Li, Lianqin et al. | IEEE | 2020




    RECEIVER-DECODER OF CODE ELECTRONIC BLOCKING CODES

    GRACHEV GAVRIL NIKOLAEVICH / GUROV SERGEJ VLADIMIROVICH / KOROLKOV ALEKSANDR GENNADEVICH et al. | Europäisches Patentamt | 2019

    Freier Zugriff