Theory, Ronneby, Sweden, 1976. [136] E. J. Weldon, Jr., "Coding for a multiple access channel," Inform. Contr., vol. 36, no. 3, pp. 256-274, 1978. [137] T. Kasami and S. Lin, "Bounds on the achievable rates of block coding for a memoryless multiple-access channel," IEEE Trans. Inform. Theory, IT-24, pp. 187-197, March 1978. [138] H.C.A. van Tiborg, "An upper bound for codes in a two-access binary erasure channel," IEEE Trans. Inform. Theory, IT-24, pp. 112-116, January 1978. [139] S.C. Chang and E.J. Weldon, Jr., "Coding for T-user multiple-access channels," IEEE Trans. Inform. Theory, IT-25, pp. 684-691, November 1979. [140] S.C. Chang and .K. Wolf, "On the T-user M-frequency multiple-access chan- nel with and without intensity information," IEEE Trans. Inform. Theory, IT- 27, no. 1, pp. 41-48, January 1981. [141] R. L. Peterson, Tree, Trellis, and Convolutional Coding for Multiple-Access Channels, Department of Electrical Engineering, Illinois Institute of Technology, Technical Report EE, 7808-32-02, August 1978. [142] P.R. Chevillat, N-User Trellis Coding for a Class of Multiple-Access Channels, IBM Research Report, Zurich, Switzerland, RZ 928 (#31790), November 1978. [143] D. J. Costello and R. L. Peterson, "Binary convolutional codes for a multiple- access channel, IEEE Trans. Inform. Theory, IT-25, pp. 101-105, January 1979. [144] R. L. Peterson and D. J. Costello, Jr., "Error probability and free distance bounds for two-user tree codes on multiple-access channels," IEEE Trans. Inform. Theory, IT-26, pp. 658-670, November 1980. [145] P.R. Chevillat, "N-user trellis coding for a class of multiple-access channels," IEEE Trans. Inform. Theory, IT-27, pp. 114-120, January 1981. [146] J.K. Omura and R. Sorace, "Coding for a multiple access channel," 1979 NTC Record, 1979, pp. 23.4.1-23.4.7, Washington, DC. [147] R. Sorace, Analysis of Noncoherent Multiple Access Communication Channels, Ph.D. Dissertation, University of California, Los Angeles, CA, 1981. [148] Q. Vo, Optimal Detection of Multiple Access Spread Sp