By Topic

Code construction for the T-user noiseless adder channel

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
G. H. Khachatrian ; Inst. of Problems of Inf. & Autom., Acad. of Sci. of Armenia, Yerevan, Armenia ; S. S. Martirossian

A general method for constructing codes for the T-user noiseless adder channel is proposed which achieves the largest sum rate known. The authors consider a multiple-access communication system. In this system, T statistically independent sources which use binary block codes C1 ,...,CT of equal length n, simultaneously transmit information via one common channel, maintaining synchronization with respect to words and bits. The output of the adder channel is the (T+l)-ary vector which is the component-wise arithmetic sum of the transmitted binary vectors. The task of the decoder is to uniquely determine the messages of all users

Published in:

IEEE Transactions on Information Theory  (Volume:44 ,  Issue: 5 )