Theoretical and phenomenological approaches to parity-non-conserving nuclear forces are
reviewed. Recent developments in the calculation of weak meson-nucleon coupling …

This paper deals with the design of low-rate sparse-graph codes, having a linear minimum
distance d_ {min} in the blocklength n. Its main contributions are: a) a necessary condition …

A possibility of estimating the finite-length performance of sparse-graph code ensembles
gives two opportunities: to compare different codes of the same length in a context very …

La découverte dans les années 90 des Turbo-codes et, plus généralement du principe
itératif appliqué au traitement du signal, a révolutionné la manière d'appréhender un …

CC-GLPDC codes are a class of generalized low-density parity-check (GLDPC) codes
where the constraint nodes (CNs) represent convolutional codes. This allows for efficient …

This work proposes a tractable evaluation of the maximum a posteriori (MAP) threshold of
sparse-graph ensembles, by using an approximation for the extended belief propagation …

We investigate a new class of codes which is in a sense a hybrid between LDPC codes and
turbo-codes. Some members of this new class have been shown to be asymptotically good …

We generalize the results about how to compute iterative decoding thresholds over the
binary erasure channel of non-binary LDPC code ensembles of [16] to non-binary TLDPC …

This paper addresses the issue of design of low-rate sparse-graph codes with linear
minimum distance in the blocklength. First, we define a necessary condition which needs to …

Due to difficulties for Vasy to obtain PhD students in Grenoble (a problem pointed out during
the previous evaluation in 2003), Vasy decided to join the Lig (Laboratoire d'Informatique de …