simultaneous users of a discrete memoryless multiple-access channel. A new random coding performance bound for this trellis coding is given in an algebraic form. Since this bound lacks ease of computation, a transfer function bound is derived as a more tractable alternative.