Decoding of superimposed codes in multiaccess communication
Ways of sharing a common channel without feedback are considered. The channel is assumed to be a multiaccess OR channel and the decoding problem is considered for a certain class of superimposed codes. A decoding algorithm is proposed and analyzed in terms of maximal decoding complexity. The robustness of the decoding algorithm is tested by simulations of decoding beyond the designed capability of the code.<<ETX>>