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 C/sub 1/,...,C/sub T/ of...
No comments yet
Be the first to share your thoughts!