Trellis coding is investigated for a class of N-user multiple-access channels. It is shown that
N-user trellis coding, in conjunction with Viterbi or sequential decoding, permits the multiple …

Binary convolutional (linear) code pairs are investigated for use on the two-user adder
channel. Maximum likelihood decoding is discussed, and a two-user decoding trellis is …

Two-user tree codes are considered for use on an arbitrary two-user discrete memoryless
multiple-access channel (MAC). A two-user tree Is employed to achieve true maximum …

We consider trellis-coding techniques for improving the reliability of digital transmission over
noisy partial-response channels. Such channels are commonly encountered in digital …

A trellis design procedure for the M-user binary-adder channel is introduced. Based on this
technique, trellis diagrams for some known 2-user coding schemes have been designed. In …

Further results on coding for T-user multiple-access channels (Corresp.) Page 1 IEEE
TRANSACTIONS ON INFORMATION THEORY, VOL. IT-30, NO. 2, MARCH 1984 411 Apply …

The efficient use of transmission facilities often requires the sharing of resources by a
number of users. Commonly used methods of shared media access are time division …

Nonorthogonal multiuser coding is an essential technique for superimposed transmission
and improving spectrum efficiency of future wireless communication networks. In this paper …

Convolutional tree codes for multiple access channels (Corresp.) Page 1 CORRESPONDENCE
397 Proof: a) If e = eiezes . a . is an error of weight t or less, then every vector e(ii)m+i . . . ei …

The increased data rates and reliability required to support emerging multimedia
applications require new communications technology. We present results regarding two …