Erasure-correcting vs. erasure-detecting codes for the full-duplex binary erasure relay channel
Erasure-correcting vs. erasure-detecting codes for the full-duplex binary erasure relay channel
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.
- École Nationale Supérieure de l'Électronique et de ses Applications France
- Supélec France
- ENSEEIHT France
- French National Centre for Scientific Research France
- CY Cergy Paris University France
[MATH.MATH-IT] Mathematics [math]/Information Theory [math.IT], [INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT]
[MATH.MATH-IT] Mathematics [math]/Information Theory [math.IT], [INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT]
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!