On the Error Exponents of ARQ Channels With Deadlines

DOI10.1109/TIT.2007.907431MaRDI QIDQ3548975zbMATH OpenOpenAlexFDO

Authors Praveen Kumar Gopala, Young-Han Nam, Hesham El Gamal

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/cs/0610106

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40) Decoding (94B35)

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 page was built for publication: On the Error Exponents of ARQ Channels With Deadlines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3548975)