On the Error Exponents of ARQ Channels with Deadlines

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

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

     

Profile ID: LFWR-SCP-O-99408

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.