Home > Research > Publications & Outputs > Cyclic codes for T-user channel over integer ri...
View graph of relations

Cyclic codes for T-user channel over integer rings.

Research output: Contribution to Journal/MagazineJournal article

<mark>Journal publication date</mark>1994
<mark>Journal</mark>Electronics Letters
Issue number3
Number of pages2
Pages (from-to)209-210
Publication StatusPublished
<mark>Original language</mark>English


Coding for the synchronous noiseless T-user real adder channel is considered by employing cyclic codes with symbols from an arbitrary finite integer ring. The code construction is based on the factorisation of xn-1 over the unit ring of an appropriate extension of a finite integer ring. Any number of users in the system can be independently active and the maximum achievable sum rate is 1 (when all T users are active)

Bibliographic note

"©1994 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE." "This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder."