In this thesis we work with message-passing decoding on self-dual F4-additive codes. We present and disprove the a decoding scheme proposed by Parker et al. in an unpublished manuscript [17]. We refer to this scheme as Embedded Factor Graph decoding. The method of Discriminative decoding is developed and described in this work as a replacement for the embedded decoding. It is shown to be exact ...

The order statistics based list decoding techniques for linear binary block codes of small to medium block length are investigated. The construction of the list of the test error patterns is considered. The original order statistics decoding is generalized by assuming segmentation of the most reliable independent positions of the received bits. The segmentation is shown to overcome several draw...

This paper revisits the ordered statistics decoding (OSD). It provides a comprehensive analysis of OSD algorithm by characterizing statistical properties, evolution and distribution Hamming distance weighted from codeword estimates to received sequence in reprocessing stages algorithm. We prove that distributions can be characterized as mixture models capturing error probability code weight enu...

In this paper, the performance of quadratic residue (QR) codes of lengths within 100 is given and analyzed when the hard decoding, soft decoding, and linear programming decoding algorithms are utilized. We develop a simple method to estimate the soft decoding performance, which avoids extensive simulations. Also, a simulation-based algorithm is proposed to obtain the maximum likelihood decoding...

The goal of this longitudinal study was to examine how lexical quality predicts the emergence of literacy abilities in 169 Dutch kindergarten children before formal reading instruction has started. At the beginning of the school year, a battery of precursor measures associated with lexical quality was related to the emergence of letter knowledge and word decoding. Confirmatory factor analysis e...

LDPC convolutional codes have been shown to be capable of achieving the same capacity-approaching performance as LDPC block codes with iterative message-passing decoding. However, traditional means of comparing block and convolutional codes tied to the implementation complexity of trellisbased decoding are irrelevant for message-passing decoders. In this paper, we undertake a comparison of LDPC...

New decoding algorithms for binary linear codes based on the concave-convex procedure are presented. Numerical experiments show that the proposed decoding algorithms surpass Belief Propagation (BP) decoding in error performance. Average computational complexity of one of the proposed decoding algorithms is only a few times greater than that of the BP decoding. key words: concave-convex procedur...

In this letter, we propose an efficient on-the-fly algorithm for maximum-likelihood decoding of Raptor codes used over the binary erasure channel. It is shown that our proposed decoding algorithm can reduce the actual elapsed decoding time by more than two-thirds with respect to an optimized conventional maximum-likelihood decoding. key words: raptor codes, on-the-fly decoding, maximum-likeliho...