Erasure-correcting vs. erasure-detecting codes for the full-duplex binary erasure relay channel

Marina Ivashkina (1) , Iryna Andriyanova (2) , Pablo Piantanida (3) , C. Poulliat (2)

1 ENSEA - Ecole Nationale Supérieure de l'Electronique et de ses Applications
2 ETIS - UMR 8051 - Equipes Traitement de l'Information et Systèmes
3 E3S - Supélec Sciences des Systèmes

In this paper, the asymptotic iterative performance of block-Markov, sparse-graph codes over the binary erasure relay channel is investigated. Note that the full-duplex relay channel is a particular case of the considered model. We obtain two interesting results: a) the block-Markov structure does not improve the asymptotic performance of good erasure-correcting sparse-graph codes; b) under certain conditions, it does however improve the asymptotic performance of good erasure-detecting (i.e. bad erasure-correcting) sparse-graph codes.

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

Marina Ivashkina, Iryna Andriyanova, Pablo Piantanida, C. Poulliat. Erasure-correcting vs. erasure-detecting codes for the full-duplex binary erasure relay channel. 2012 IEEE International Symposium on Information Theory Proceedings, Jul 2012, Cambridge, MA, United States. pp.945 - 949, ⟨10.1109/ISIT.2012.6284702⟩. ⟨hal-00749333⟩