Abstract
1 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
