A new universal random coding bound for the multiple-access channel

  • Authors:
  • Yu-Sun Liu;B. L. Hughes

  • Affiliations:
  • Dept. of Electr. & Comput. Eng., Johns Hopkins Univ., Baltimore, MD;-

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 2006

Quantified Score

Hi-index 754.96

Visualization

Abstract

The minimum average error probability achievable by block codes on the two-user multiple-access channel is investigated. A new exponential upper bound is found which can be achieved universally for all discrete memoryless multiple-access channels with given input and output alphabets. It is shown that the exponent of this bound is greater than or equal to those of previously known bounds. Moreover, examples are given where the new exponent is strictly larger