Analysis of Collision Channel with Asynchronous Access

Laszlo GYORFI  Sandor GYORI  

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E88-A   No.10   pp.2878-2884
Publication Date: 2005/10/01
Online ISSN: 
DOI: 10.1093/ietfec/e88-a.10.2878
Print ISSN: 0916-8508
Type of Manuscript: Special Section PAPER (Special Section on Information Theory and Its Applications)
Category: Communication Theory
Keyword: 
multiple access collision channel,  identification,  synchronization,  decoding,  error probability,  

Full Text: PDF(230.8KB)>>
Buy this Article




Summary: 
A T user multiple access collision channel without feedback is considered where the channel inputs are called packets. The packets take values from non-binary input alphabet. It is supposed that at most M users are active, i.e., are communicating simultaneously (2 M T). We are looking for codes and protocol sequences of users of minimum length such that from the output of the channel it can be determined which users were active, what were their synchron positions, and what they sent.