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

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/ISSNConference contribution/Paperpeer-review

Published
Publication date1/01/2001
Host publicationProceedings - 2001 IEEE Information Theory Workshop, ITW 2001
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages96-98
Number of pages3
ISBN (electronic)0780371194, 9780780371194
<mark>Original language</mark>English
Event2001 IEEE Information Theory Workshop, ITW 2001 - Cairns, Australia
Duration: 2/09/20017/09/2001

Conference

Conference2001 IEEE Information Theory Workshop, ITW 2001
Country/TerritoryAustralia
CityCairns
Period2/09/017/09/01

Publication series

NameProceedings - 2001 IEEE Information Theory Workshop, ITW 2001

Conference

Conference2001 IEEE Information Theory Workshop, ITW 2001
Country/TerritoryAustralia
CityCairns
Period2/09/017/09/01

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.