Asymptotically good codes with high iterative decoding performances

Iryna Andriyanova (1) , Tillich Jean-Pierre (2) , Carlach Jean-Claude (1)

1 Orange Labs R&D [Rennes]
2 SECRET - Security, Cryptology and Transmissions

We investigate a new class of codes which is in some senses a hybrid between LDPC codes and turbo-codes. We show that when the parameters of this class are well chosen they have very good iterative decoding performances and at the same time a minimum distance which is typically linear in the code length

Domaines: Théorie de l'information [cs.IT]; Théorie de l'information et codage [math.IT]

Iryna Andriyanova, Tillich Jean-Pierre, Carlach Jean-Claude. Asymptotically good codes with high iterative decoding performances. IEEE International Symposium on Information Theory : ISIT 2005, Sep 2005, Adelaide, Australia. pp.850-854, ⟨10.1109/ISIT.2005.1523457⟩. ⟨hal-00524604⟩