New bounds on the maximal error exponent for multiple-access channels


The problem of bounding the reliability function of a multiple-access channel (MAC) is studied. An upper bound on the minimum Bhattacharyya distance between codeword pairs is derived. For a certain large class of two-user discrete memoryless (DM) MAC, a lower bound on the maximal probability of decoding error is derived as a consequence of the upper bound… (More)
DOI: 10.1109/ISIT.2009.5205760