Erasure-correcting vs. erasure-detecting codes for the full-duplex binary erasure relay channel - CentraleSupélec Access content directly
Conference Papers Year : 2012

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

Abstract

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.
No file

Dates and versions

hal-00749333 , version 1 (07-11-2012)

Identifiers

Cite

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⟩
112 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More