Home > Research > Publications & Outputs > A Line Code Construction for the Adder Channel ...

Research

Associated organisational units

Links

Text available via DOI:

View graph of relations

A Line Code Construction for the Adder Channel with Rates Higher than Time-Sharing

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

Published

Standard

A Line Code Construction for the Adder Channel with Rates Higher than Time-Sharing. / Benachour, Phillip; Farrell, Paddy; Honary, Bahram.
Cryptography and Coding: 8th IMA International Conference Cirencester, UK, December 17–19, 2001 Proceedings. ed. / Bahram Honary. Berlin: Springer, 2001. p. 166-175 (Lecture Notes in Computer Science; Vol. 2260).

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

Harvard

Benachour, P, Farrell, P & Honary, B 2001, A Line Code Construction for the Adder Channel with Rates Higher than Time-Sharing. in B Honary (ed.), Cryptography and Coding: 8th IMA International Conference Cirencester, UK, December 17–19, 2001 Proceedings. Lecture Notes in Computer Science, vol. 2260, Springer, Berlin, pp. 166-175. https://doi.org/10.1007/3-540-45325-3_16

APA

Benachour, P., Farrell, P., & Honary, B. (2001). A Line Code Construction for the Adder Channel with Rates Higher than Time-Sharing. In B. Honary (Ed.), Cryptography and Coding: 8th IMA International Conference Cirencester, UK, December 17–19, 2001 Proceedings (pp. 166-175). (Lecture Notes in Computer Science; Vol. 2260). Springer. https://doi.org/10.1007/3-540-45325-3_16

Vancouver

Benachour P, Farrell P, Honary B. A Line Code Construction for the Adder Channel with Rates Higher than Time-Sharing. In Honary B, editor, Cryptography and Coding: 8th IMA International Conference Cirencester, UK, December 17–19, 2001 Proceedings. Berlin: Springer. 2001. p. 166-175. (Lecture Notes in Computer Science). doi: 10.1007/3-540-45325-3_16

Author

Benachour, Phillip ; Farrell, Paddy ; Honary, Bahram. / A Line Code Construction for the Adder Channel with Rates Higher than Time-Sharing. Cryptography and Coding: 8th IMA International Conference Cirencester, UK, December 17–19, 2001 Proceedings. editor / Bahram Honary. Berlin : Springer, 2001. pp. 166-175 (Lecture Notes in Computer Science).

Bibtex

@inproceedings{a56dfeaa8fd84189acf562ba03d68ead,
title = "A Line Code Construction for the Adder Channel with Rates Higher than Time-Sharing",
abstract = "In this paper, line coding schemes and their application to the multiuser adder channel are investigated. The focus is on designing line codes with higher information per channel use rates than time- sharing. We show that by combining short multi-user line codes, it is possible to devise longer 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.",
author = "Phillip Benachour and Paddy Farrell and Bahram Honary",
year = "2001",
doi = "10.1007/3-540-45325-3_16",
language = "English",
isbn = "978-3-540-43026-1",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "166--175",
editor = "Bahram Honary",
booktitle = "Cryptography and Coding",

}

RIS

TY - GEN

T1 - A Line Code Construction for the Adder Channel with Rates Higher than Time-Sharing

AU - Benachour, Phillip

AU - Farrell, Paddy

AU - Honary, Bahram

PY - 2001

Y1 - 2001

N2 - In this paper, line coding schemes and their application to the multiuser adder channel are investigated. The focus is on designing line codes with higher information per channel use rates than time- sharing. We show that by combining short multi-user line codes, it is possible to devise longer 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.

AB - In this paper, line coding schemes and their application to the multiuser adder channel are investigated. The focus is on designing line codes with higher information per channel use rates than time- sharing. We show that by combining short multi-user line codes, it is possible to devise longer 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.

U2 - 10.1007/3-540-45325-3_16

DO - 10.1007/3-540-45325-3_16

M3 - Conference contribution/Paper

SN - 978-3-540-43026-1

T3 - Lecture Notes in Computer Science

SP - 166

EP - 175

BT - Cryptography and Coding

A2 - Honary, Bahram

PB - Springer

CY - Berlin

ER -