Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review

Published

Proceedings of IEEE ICC '93: Communications, technology that unites nations, Geneva, Switzerland. Vol. 3 Piscataway, N.J.: Institute of Electrical and Electronics Engineers, 1993. p. 1429-1434.

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review

da Rocha, VC, Markarian, GS & 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.* vol. 3, Institute of Electrical and Electronics Engineers, Piscataway, N.J., pp. 1429-1434. https://doi.org/10.1109/ICC.1993.397523

da Rocha, V. C., Markarian, G. S., & 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 *(Vol. 3, pp. 1429-1434). Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/ICC.1993.397523

da Rocha VC, Markarian GS, Honary B. 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. Vol. 3. Piscataway, N.J.: Institute of Electrical and Electronics Engineers. 1993. p. 1429-1434 doi: 10.1109/ICC.1993.397523

@inproceedings{1934a767336245769d83c3ad5f80f39a,

title = "Trellis decoding of block codes for the 2-user binary adder channel.",

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.",

author = "{da Rocha}, {V. C.} and Markarian, {G. S.} and B. Honary",

year = "1993",

doi = "10.1109/ICC.1993.397523",

language = "English",

isbn = "0-7803-0950-2.",

volume = "3",

pages = "1429--1434",

booktitle = "Proceedings of IEEE ICC '93: Communications, technology that unites nations, Geneva, Switzerland",

publisher = "Institute of Electrical and Electronics Engineers",

}

TY - GEN

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

AU - da Rocha, V. C.

AU - Markarian, G. S.

AU - Honary, B.

PY - 1993

Y1 - 1993

N2 - 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.

AB - 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.

U2 - 10.1109/ICC.1993.397523

DO - 10.1109/ICC.1993.397523

M3 - Conference contribution/Paper

SN - 0-7803-0950-2.

VL - 3

SP - 1429

EP - 1434

BT - Proceedings of IEEE ICC '93: Communications, technology that unites nations, Geneva, Switzerland

PB - Institute of Electrical and Electronics Engineers

CY - Piscataway, N.J.

ER -