IEICE TRANSACTIONS on Fundamentals
Uniquely Decodable Code for Three-User Binary Adder Channel
Summary :
A uniquely decodable code (C1, C2, C3) is investigated for the three-user binary adder channel. The uniquely decodable code is constructed as follows: If C1 is an (n, k) linear code with a generator matrix, C2 is a coset of C1 and C3 is a set of all coset leaders, then the code (C1, C2, C3) is uniquely decodable and its total rate is equal to 1
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E78-A No.9 pp.1206-1208
- Publication Date
- 1995/09/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section LETTER (Special Section on Information Theory and Its Applications)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Jian-Jun SHI, Yoichiro WATANABE, "Uniquely Decodable Code for Three-User Binary Adder Channel" in IEICE TRANSACTIONS on Fundamentals,
vol. E78-A, no. 9, pp. 1206-1208, September 1995, doi: .
Abstract: A uniquely decodable code (C1, C2, C3) is investigated for the three-user binary adder channel. The uniquely decodable code is constructed as follows: If C1 is an (n, k) linear code with a generator matrix, C2 is a coset of C1 and C3 is a set of all coset leaders, then the code (C1, C2, C3) is uniquely decodable and its total rate is equal to 1
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e78-a_9_1206/_p
Copy
@ARTICLE{e78-a_9_1206,
author={Jian-Jun SHI, Yoichiro WATANABE, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Uniquely Decodable Code for Three-User Binary Adder Channel},
year={1995},
volume={E78-A},
number={9},
pages={1206-1208},
abstract={A uniquely decodable code (C1, C2, C3) is investigated for the three-user binary adder channel. The uniquely decodable code is constructed as follows: If C1 is an (n, k) linear code with a generator matrix, C2 is a coset of C1 and C3 is a set of all coset leaders, then the code (C1, C2, C3) is uniquely decodable and its total rate is equal to 1
keywords={},
doi={},
ISSN={},
month={September},}
Copy
TY - JOUR
TI - Uniquely Decodable Code for Three-User Binary Adder Channel
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1206
EP - 1208
AU - Jian-Jun SHI
AU - Yoichiro WATANABE
PY - 1995
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E78-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 1995
AB - A uniquely decodable code (C1, C2, C3) is investigated for the three-user binary adder channel. The uniquely decodable code is constructed as follows: If C1 is an (n, k) linear code with a generator matrix, C2 is a coset of C1 and C3 is a set of all coset leaders, then the code (C1, C2, C3) is uniquely decodable and its total rate is equal to 1
ER -
English
