Random Access Algorithms with Multiple Reception Capability and $n$-ary Feedback Channel

Random access algorithms to a common channel with multiple reception capability by receivers and an $n$-ary feedback channel are presented. The algorithms belong to the class of splitting algorithms. It is shown that the throughput of these algorithms is 1.5–3% higher than the throughput of the best known algorithm with ternary feedback channel.