On the Error Exponents of ARQ Channels with Deadlines
arXiv:cs/0610106 · doi:10.1109/TIT.2007.907431
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.
16 pages, 6 figures, Submitted to the IEEE Trans. on Information Theory