On the Error Exponents of ARQ Channels with Deadlines
classification
💻 cs.IT
math.IT
keywords
channelsdeadlineserrorexponentsmemorylessachievableautomaticbound
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.