12,000

We have over 12,000 students, from over 100 countries, within one of the safest campuses in the UK

93%

93% of Lancaster students go into work or further study within six months of graduating

Home > Research > Publications & Outputs > Trellis decoding of block codes for the 2-user ...
View graph of relations

Text available via DOI:

« Back

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

Research output: Contribution in Book/Report/ProceedingsPaper

Published

Publication date1993
Host publicationProceedings of IEEE ICC '93: Communications, technology that unites nations, Geneva, Switzerland
Place of publicationPiscataway, N.J.
PublisherInstitute of Electrical and Electronics Engineers
Pages1429-1434
Number of pages6
Volume3
ISBN (Print)0-7803-0950-2.
Original languageEnglish

Abstract

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.