Trellis decoding of block codes for the 2-user binary adder channel.

da Rocha, V. C. and Markarian, G. S. and Honary, B. (1993) Trellis decoding of block codes for the 2-user binary adder channel. In: Proceedings of IEEE ICC '93: Communications, technology that unites nations, Geneva, Switzerland. Institute of Electrical and Electronics Engineers, Piscataway, N.J., pp. 1429-1434. ISBN 0-7803-0950-2.

Full text not available from this repository.


The decoding problem for block codes on the two-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-weight 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 to maximum likelihood decoding depends on the choice of the code pair. The resulting decoder complexity is proportional to the sum (rather than the product) of the number of codewords in the two component codes.

Item Type: Contribution in Book/Report/Proceedings
Uncontrolled Keywords: /dk/atira/pure/researchoutput/libraryofcongress/ta
Departments: Faculty of Science and Technology > School of Computing & Communications
Faculty of Science and Technology > Engineering
ID Code: 20655
Deposited By: ep_ss_importer
Deposited On: 28 Nov 2008 11:20
Refereed?: Yes
Published?: Published
Last Modified: 30 Sep 2019 10:17

Actions (login required)

View Item View Item