By Topic

A multiuser k-ary code for the noisy multiple-access 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
$31 $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)
Jun Cheng ; Dept. of Knowledge Eng. & Comput. Sci., Doshisha Univ., Kyoto, Japan ; Watanabe, Y.

Multiuser k-ary coding is proposed for a noisy multiple-access adder channel. It is shown that when a T-user δ-decodable k-ary code C is given a priori, a qT-user λδ-decodable k-ary code C* is obtained by using a matrix, such as a Hadamard matrix or a conference matrix of order q, where λ is a positive integer depending on the matrix. More noteworthy is that the code C is an arbitrary δ-decodable k-ary code, and that the coding scheme preserves the total rate, i.e., the total rate of C* is equal to that of C

Published in:

Information Theory, IEEE Transactions on  (Volume:47 ,  Issue: 6 )