Analysis of Collision Channel with Asynchronous Access

摘要

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.