UNIQUELY DECODABLE CODE FOR 3-USER BINARY ADDER CHANNEL

Authors
SHI JJ WATANABE Y
Citation
Jj. Shi et Y. Watanabe, UNIQUELY DECODABLE CODE FOR 3-USER BINARY ADDER CHANNEL, IEICE transactions on fundamentals of electronics, communications and computer science, E78A(9), 1995, pp. 1206-1208
Citations number
NO
Categorie Soggetti
Engineering, Eletrical & Electronic","Computer Science Hardware & Architecture","Computer Science Information Systems
Journal title
IEICE transactions on fundamentals of electronics, communications and computer science → ACNP
ISSN journal
09168508
Volume
E78A
Issue
9
Year of publication
1995
Pages
1206 - 1208
Database
ISI
SICI code
0916-8508(1995)E78A:9<1206:UDCF3B>2.0.ZU;2-E
Abstract
A uniquely decodable code (C-1, C-2, C-3) is investigated for the thre e-user binary adder channel. The uniquely decodable code is constructe d as follows: If C-1 is an (n, k) linear code with a generator matrix, C-2 is a coset of C-1 and C-3 is a set of all coset leaders, then the code (C-1, C-2, C-3) is uniquely decodable and its total rate is equa l to 1 + k/n, n greater than or equal to 2k. This code is easily decod able.