The decoding problem for block Codes on the 2-user binary adder channel is discussed and a decoding algorithm based on a trellis diagram is introduced for the case where at least one of the component codes is a constant-weiqht Code whose codewords belong to a known linear code.Both the noiseless and the noisy cases are considered. In the noisy case it is possible to perform soft-decision decoding with a performance whose closeness tomaximum likelihood decoding de-pends on the choice of the codepair.The resulting decoder com-plexity is proportional to the sum (rather than the product) of the number of codewordS in the two component codes.
展开▼
