We compare the performance of short-length linear binary codes on the binary erasure channel and the binary-input Gaussian channel. We use a universal decoder that can decode any linear binary block code: Gaussian-elimination based Maximum-Likelihood decoder on the erasure channel and probabilistic Ordered Statistics Decoder on the Gaussian channel. As such we compare codes and not decoders. The word error rate versus the channel parameter is found for LDPC, Reed-Muller, Polar, and BCH codes at length 256 bits. BCH codes outperform other codes in absence of cyclic redundancy check. Under joint decoding, the concatenation of a cyclic redundancy check makes all codes perform very close to optimal lower bounds.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Performance comparison of short-length error-correcting codes


    Contributors:


    Publication date :

    2016-11-01


    Size :

    125605 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Comma-free error-correcting codes.

    Stiffler, J. J. | NTRS | 1965


    Error-correcting codes in computer arithmetic.

    Massey, J. L. / Garcia, O. N. | NTRS | 1972


    Face verification using error correcting output codes

    Kittler, J. / Ghaderi, R. / Windeatt, T. et al. | IEEE | 2001


    Face Verification Using Error Correcting Output Codes

    Kittler, J. / Ghaderi, R. / Windeatt, T. et al. | British Library Conference Proceedings | 2001


    Face verification via error correcting output codes

    Kittler, J. / Ghaderi, R. / Windeatt, T. et al. | British Library Online Contents | 2003