Graph-Theoretical Construction of Uniquely Decodable Code Pair for the Two-User Binary Adder Channel

Feng GUO; Yoichiro WATANABE

Graph-Theoretical Construction of Uniquely Decodable Code Pair for the Two-User Binary Adder Channel

Feng GUO, Yoichiro WATANABE

Full Text Views

0

Cite this

Summary :

It is known that the uniquely decodable code pairs (C₁, C₂) for the two-user binary adder channel relates to the maximum independent set of a graph associated with a binary code. This paper formulates the independence number of a class of graphs associated with binary linear codes, and presents an algorithm of the maximum independent set for those graphs. Uniquely decodable code pairs (C₁, C₂)'s are produced, where C₁ is a linear code and C₂ is a maximum independent set of the graph associated with C₁. For the given C₁, the transmission rate of C₂ is higher than that by Khachatrian, which is known as the best result as so far. This is not rather surprising because the code C₂ is a maximum independent set in this paper but not be Khachatrian's.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E75-A No.4 pp.492-497

Publication Date: 1992/04/25

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Issue on Discrete Mathematics and Its Application)

Category

Cite this

Copy

Feng GUO, Yoichiro WATANABE, "Graph-Theoretical Construction of Uniquely Decodable Code Pair for the Two-User Binary Adder Channel" in IEICE TRANSACTIONS on Fundamentals, vol. E75-A, no. 4, pp. 492-497, April 1992, doi: .
Abstract: It is known that the uniquely decodable code pairs (C₁, C₂) for the two-user binary adder channel relates to the maximum independent set of a graph associated with a binary code. This paper formulates the independence number of a class of graphs associated with binary linear codes, and presents an algorithm of the maximum independent set for those graphs. Uniquely decodable code pairs (C₁, C₂)'s are produced, where C₁ is a linear code and C₂ is a maximum independent set of the graph associated with C₁. For the given C₁, the transmission rate of C₂ is higher than that by Khachatrian, which is known as the best result as so far. This is not rather surprising because the code C₂ is a maximum independent set in this paper but not be Khachatrian's.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e75-a_4_492/_p

Copy

@ARTICLE{e75-a_4_492,
author={Feng GUO, Yoichiro WATANABE, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Graph-Theoretical Construction of Uniquely Decodable Code Pair for the Two-User Binary Adder Channel},
year={1992},
volume={E75-A},
number={4},
pages={492-497},
abstract={It is known that the uniquely decodable code pairs (C₁, C₂) for the two-user binary adder channel relates to the maximum independent set of a graph associated with a binary code. This paper formulates the independence number of a class of graphs associated with binary linear codes, and presents an algorithm of the maximum independent set for those graphs. Uniquely decodable code pairs (C₁, C₂)'s are produced, where C₁ is a linear code and C₂ is a maximum independent set of the graph associated with C₁. For the given C₁, the transmission rate of C₂ is higher than that by Khachatrian, which is known as the best result as so far. This is not rather surprising because the code C₂ is a maximum independent set in this paper but not be Khachatrian's.},
keywords={},
doi={},
ISSN={},
month={April},}

Copy

TY - JOUR
TI - Graph-Theoretical Construction of Uniquely Decodable Code Pair for the Two-User Binary Adder Channel
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 492
EP - 497
AU - Feng GUO
AU - Yoichiro WATANABE
PY - 1992
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E75-A
IS - 4
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - April 1992
AB - It is known that the uniquely decodable code pairs (C₁, C₂) for the two-user binary adder channel relates to the maximum independent set of a graph associated with a binary code. This paper formulates the independence number of a class of graphs associated with binary linear codes, and presents an algorithm of the maximum independent set for those graphs. Uniquely decodable code pairs (C₁, C₂)'s are produced, where C₁ is a linear code and C₂ is a maximum independent set of the graph associated with C₁. For the given C₁, the transmission rate of C₂ is higher than that by Khachatrian, which is known as the best result as so far. This is not rather surprising because the code C₂ is a maximum independent set in this paper but not be Khachatrian's.
ER -