Random coding bound and codes produced by permutations for the multiple-access channel

A random coding bound for the multiple-access channel (MAC) is given, and it is shown to be obtainable universally for all MAC´s with common input and output alphabets. For channels for which the random coding bound may be achieved by codes consisting of codewords of a single type for each sender, this bound is also achievable by codes produced by permutations.