On the performance of permutation codes for multi-user communication

Considers a system of information transmission for T pairs of users (sender, receiver) numbered 1,..., T, which can be viewed as an extension of the T-user M-frequency noiseless multiple access channel model Each of the T senders uses the same input alphabet of M integers and the idle symbol. The output of the channel at each time instant is a symbol identifying which subset of integers occurred as input to the channel.