A new family of codes with high iterative decoding performances

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 and we conjecture that such a behavior holds for all classes of codes presented here. They all display excellent iterative decoding performances with no error floor at block error rates up to 10-6 for lengths of several thousand together with low average decoding complexity.