Abstract
The reliability exponent E(R) of the Bedekar-Azizog̃lu discrete-time geometric-server timing channel with service rate μ packets per slot is determined for all rates R between the critical rate Rc and the channel capacity. For rates between 0 and Rc, we provide a random-coding lower bound Er(R) and a sphere-packing upper bound Esp(R) on E(R).
Original language | English |
---|---|
Pages (from-to) | 445 |
Number of pages | 1 |
Journal | IEEE International Symposium on Information Theory - Proceedings |
State | Published - 2004 |
Externally published | Yes |
Event | Proceedings - 2004 IEEE International Symposium on Information Theory - Chicago, IL, United States Duration: 27 Jun 2004 → 2 Jul 2004 |