Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Coding theorems for random access communication over compound channel

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Zheng Wang ; Electr. & Comput. Eng. Dept., Colorado State Univ., Fort Collins, CO, USA ; Jie Luo

Random access communication is used in practical systems to deliver bursty short messages. Because users only transmit occasionally, it is often difficult for the receiver to keep track of the time varying wireless channel states. Under this motivation, we develop channel coding theorems for random multiple access communication over compound channels with finite codeword length. Error performance bound and asymptotic error probability scaling laws are derived. We found that the results also help in deriving error performance bounds for the random multiple access system where the receiver is only interested in decoding messages from a user subset.

Published in:

Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on

Date of Conference:

July 31 2011-Aug. 5 2011