On the Error Exponents of ARQ Channels with Deadlines

Details On the Error Exponents of ARQ Channels with Deadlines On the Error Exponents of ARQ Channels with Deadlines

2006-10-18

arxiv.org/abs/cs/0610106v1

Computer Science

Information Theory

16 pages, 6 figures, Submitted to the IEEE Trans. on Information Theory

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On the Error Exponents of ARQ Channels with Deadlines does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Error Exponents of ARQ Channels with Deadlines, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Error Exponents of ARQ Channels with Deadlines will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-99408