On the Error Exponents of ARQ Channels with Deadlines
Information Theory
2016-11-17 v1 math.IT
Abstract
We consider communication over Automatic Repeat reQuest (ARQ) memoryless channels with deadlines. In particular, an upper bound L is imposed on the maximum number of ARQ transmission rounds. In this setup, it is shown that incremental redundancy ARQ outperforms Forney's memoryless decoding in terms of the achievable error exponents.
Cite
@article{arxiv.cs/0610106,
title = {On the Error Exponents of ARQ Channels with Deadlines},
author = {Praveen Kumar Gopala and Young-Han Nam and Hesham El Gamal},
journal= {arXiv preprint arXiv:cs/0610106},
year = {2016}
}
Comments
16 pages, 6 figures, Submitted to the IEEE Trans. on Information Theory