Sequential Decoding Algorithm in a Multiple-Access Channel

The article describes a sequential decoding algorithm in a multiple-access channel. An upper bound is obtained for the distribution of the number of decoder calculations; this bound has the form of a Pareto distribution. It is shown that, at transmission rates greater than the computing rates, sequential decoding in a multiple-access channel can provide better exchange relations between the complexity and decoding error probability than the Viterbi algorithm.