Bounds on the achievable rates of block coding for a memoryless multiple-access channel

Abstract

Block coding for a memoryless two-input single-output multiple-access channel, called a two-user adder channel, is studied. Techniques for constructing codes for this particular channel are presented. Upper and lower bounds on the achievable rates of these codes are derived. These bounds define various two-dimensional regions for the achievable rates of codes for the two-user adder channel.