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

Benachour, Phillip and Farrell, Paddy and Honary, Bahram (2001) A Line Code Construction for the Adder Channel with Rates Higher than Time-Sharing. In: Cryptography and Coding. Lecture Notes in Computer Science . Springer, Berlin, pp. 166-175. ISBN 978-3-540-43026-1

Full text not available from this repository.

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.

Item Type: Contribution in Book/Report/Proceedings
Departments: Faculty of Science and Technology > School of Computing & Communications
ID Code: 60836
Deposited By: ep_importer_pure
Deposited On: 09 Jan 2013 11:59
Refereed?: Yes
Published?: Published
Last Modified: 30 Sep 2019 11:19
URI: https://eprints.lancs.ac.uk/id/eprint/60836

Actions (login required)

View Item View Item