Performance comparison of short-length error-correcting codes
Performance comparison of short-length error-correcting codes
- Neue Suche nach: Van Wonterghem, J.
- Neue Suche nach: Alloumf, A.
- Neue Suche nach: Boutros, J.J.
- Neue Suche nach: Moeneclaey, M.
- Neue Suche nach: Van Wonterghem, J.
- Neue Suche nach: Alloumf, A.
- Neue Suche nach: Boutros, J.J.
- Neue Suche nach: Moeneclaey, M.
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.
Dokumentinformationen
Performance comparison of short-length error-correcting codes
2016-11-01
125605 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Ähnliche Titel
Face verification via error correcting output codes
| British Library Online Contents | 2003
Face verification using error correcting output codes
| IEEE | 2001
Face Verification Using Error Correcting Output Codes
| British Library Conference Proceedings | 2001