DocumentCode
3131994
Title
Erasure-correcting vs. erasure-detecting codes for the full-duplex binary erasure relay channel
Author
Ivashkina, Marina ; Andriyanova, Iryna ; Piantanida, Pablo ; Poulliat, Charly
Author_Institution
ENSEA, Univ. of Cergy-Pontoise, Cergy-Pontoise, France
fYear
2012
fDate
1-6 July 2012
Firstpage
945
Lastpage
949
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.
Keywords
Markov processes; binary codes; block codes; graph theory; iterative methods; asymptotic iterative performance; block-Markov codes; erasure-correcting codes; erasure-detecting codes; full-duplex binary erasure relay channel; sparse-graph codes; Decoding; Encoding; Iterative decoding; Joints; Relays;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on
Conference_Location
Cambridge, MA
ISSN
2157-8095
Print_ISBN
978-1-4673-2580-6
Electronic_ISBN
2157-8095
Type
conf
DOI
10.1109/ISIT.2012.6284702
Filename
6284702
Link To Document