DocumentCode :
1523554
Title :
A multiuser k-ary code for the noisy multiple-access adder channel
Author :
Cheng, Jun ; Watanabe, Yoichiro
Author_Institution :
Dept. of Knowledge Eng. & Comput. Sci., Doshisha Univ., Kyoto, Japan
Volume :
47
Issue :
6
fYear :
2001
fDate :
9/1/2001 12:00:00 AM
Firstpage :
2603
Lastpage :
2607
Abstract :
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
Keywords :
Hadamard matrices; binary codes; channel coding; decoding; error correction codes; multi-access systems; multiuser channels; noise; Hadamard matrix; binary codes; channel coding; conference matrix; error correction codes; multiuser k-ary code; multiuser k-ary coding; noisy multiple-access adder channel; nonbinary codes; total rate; uniquely decodable k-ary code; Block codes; Error correction; Error probability; Induction generators; Intersymbol interference; Linear code; Maximum likelihood decoding; Noise generators; Sequences; Viterbi algorithm;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/18.945276
Filename :
945276
Link To Document :
بازگشت