Transmission over a multiple-access channel with a special source hierarchy (Q1059046)

The multiple access channel with s sources and one receiver is considered. There is a special hierarchy of sources: the first source uses only the first coder, the second one uses the first and the second coder, the third one the first, the second and the third coder, and so on. A few lemmas and theorems are proved showing that full feedback communication does not increase the capacity region of the memoryless channel in this case. In addition this region is equal to the capacity region for a probability of binary error equal to zero if a deterministic channel is considered.