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.
Complete list of metadatas

https://hal-supelec.archives-ouvertes.fr/hal-00749333
Contributor : Catherine Magnet <>
Submitted on : Wednesday, November 7, 2012 - 11:52:12 AM
Last modification on : Thursday, May 3, 2018 - 3:18:05 PM

Identifiers

Collections

Citation

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⟩

Share

Metrics

Record views

249