On the Error Exponents of ARQ Channels with Deadlines
<|reference_start|>On the Error Exponents of ARQ Channels with Deadlines: 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.<|reference_end|>
@article{gopala2006on,
    title={On the Error Exponents of ARQ Channels with Deadlines},
    author={Praveen Kumar Gopala, Young-Han Nam and Hesham El Gamal},
    journal={arXiv preprint arXiv:cs/0610106},
    year={2006},
    doi={10.1109/TIT.2007.907431},
    archivePrefix={arXiv},
    eprint={cs/0610106},
    primaryClass={cs.IT math.IT}
}