Home > Research > Publications & Outputs > Direct sum construction of DC-free adder channe...

Research

Links

Text available via DOI:

View graph of relations

Direct sum construction of DC-free adder channel codes

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

Published

Standard

Direct sum construction of DC-free adder channel codes. / Benachour, Phillip; Farrell, Patric G.; Honary, Bahram.
Proceedings - 2001 IEEE Information Theory Workshop, ITW 2001. Institute of Electrical and Electronics Engineers Inc., 2001. p. 96-98 955148 (Proceedings - 2001 IEEE Information Theory Workshop, ITW 2001).

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

Harvard

Benachour, P, Farrell, PG & Honary, B 2001, Direct sum construction of DC-free adder channel codes. in Proceedings - 2001 IEEE Information Theory Workshop, ITW 2001., 955148, Proceedings - 2001 IEEE Information Theory Workshop, ITW 2001, Institute of Electrical and Electronics Engineers Inc., pp. 96-98, 2001 IEEE Information Theory Workshop, ITW 2001, Cairns, Australia, 2/09/01. https://doi.org/10.1109/ITW.2001.955148

APA

Benachour, P., Farrell, P. G., & Honary, B. (2001). Direct sum construction of DC-free adder channel codes. In Proceedings - 2001 IEEE Information Theory Workshop, ITW 2001 (pp. 96-98). Article 955148 (Proceedings - 2001 IEEE Information Theory Workshop, ITW 2001). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ITW.2001.955148

Vancouver

Benachour P, Farrell PG, Honary B. Direct sum construction of DC-free adder channel codes. In Proceedings - 2001 IEEE Information Theory Workshop, ITW 2001. Institute of Electrical and Electronics Engineers Inc. 2001. p. 96-98. 955148. (Proceedings - 2001 IEEE Information Theory Workshop, ITW 2001). doi: 10.1109/ITW.2001.955148

Author

Benachour, Phillip ; Farrell, Patric G. ; Honary, Bahram. / Direct sum construction of DC-free adder channel codes. Proceedings - 2001 IEEE Information Theory Workshop, ITW 2001. Institute of Electrical and Electronics Engineers Inc., 2001. pp. 96-98 (Proceedings - 2001 IEEE Information Theory Workshop, ITW 2001).

Bibtex

@inproceedings{815fc00b8fbf4bb0be8f00c02846c86c,
title = "Direct sum construction of DC-free adder channel codes",
abstract = "The design of uniquely decodable DC-free multi-user coding schemes with good rate sums for the multiple access adder channel is described in this paper. It is shown that by using the direct sum construction on short multi-user codes, it is possible to devise longer DC-free multi-user coding schemes with rate sums which increase quite rapidly at each iteration of the construction. Asymptotically, there is no penalty in requiring the coding schemes to be DC-free. In addition, the schemes can be efficiently soft decision decoded using a relatively low complexity sectionalised trellis.",
author = "Phillip Benachour and Farrell, {Patric G.} and Bahram Honary",
year = "2001",
month = jan,
day = "1",
doi = "10.1109/ITW.2001.955148",
language = "English",
series = "Proceedings - 2001 IEEE Information Theory Workshop, ITW 2001",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "96--98",
booktitle = "Proceedings - 2001 IEEE Information Theory Workshop, ITW 2001",
note = "2001 IEEE Information Theory Workshop, ITW 2001 ; Conference date: 02-09-2001 Through 07-09-2001",

}

RIS

TY - GEN

T1 - Direct sum construction of DC-free adder channel codes

AU - Benachour, Phillip

AU - Farrell, Patric G.

AU - Honary, Bahram

PY - 2001/1/1

Y1 - 2001/1/1

N2 - The design of uniquely decodable DC-free multi-user coding schemes with good rate sums for the multiple access adder channel is described in this paper. It is shown that by using the direct sum construction on short multi-user codes, it is possible to devise longer DC-free multi-user coding schemes with rate sums which increase quite rapidly at each iteration of the construction. Asymptotically, there is no penalty in requiring the coding schemes to be DC-free. In addition, the schemes can be efficiently soft decision decoded using a relatively low complexity sectionalised trellis.

AB - The design of uniquely decodable DC-free multi-user coding schemes with good rate sums for the multiple access adder channel is described in this paper. It is shown that by using the direct sum construction on short multi-user codes, it is possible to devise longer DC-free multi-user coding schemes with rate sums which increase quite rapidly at each iteration of the construction. Asymptotically, there is no penalty in requiring the coding schemes to be DC-free. In addition, the schemes can be efficiently soft decision decoded using a relatively low complexity sectionalised trellis.

U2 - 10.1109/ITW.2001.955148

DO - 10.1109/ITW.2001.955148

M3 - Conference contribution/Paper

AN - SCOPUS:84938933142

T3 - Proceedings - 2001 IEEE Information Theory Workshop, ITW 2001

SP - 96

EP - 98

BT - Proceedings - 2001 IEEE Information Theory Workshop, ITW 2001

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2001 IEEE Information Theory Workshop, ITW 2001

Y2 - 2 September 2001 through 7 September 2001

ER -