In this correspondence, 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.
['Praveen Kumar Gopala', 'Young-Han Nam', 'H. El Gamal']
On the Error Exponents of ARQ Channels With Deadlines