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.
Cite
CITATION STYLE
Benachour, P., Farrell, P. G., & Honary, B. (2001). A line code construction for the adder channel with rates higher than time-sharing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2260, pp. 166–175). Springer Verlag. https://doi.org/10.1007/3-540-45325-3_16
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
