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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    On Superregular Matrices and Convolutional Codes with Finite Decoder Memory


    Contributors:


    Publication date :

    2018-06-01


    Size :

    346803 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    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. | European Patent Office | 2019

    Free access

    Simplified Decoding of Convolutional Codes

    Truong, T. K. / Reed, I. S. | NTRS | 1986