Graph Associated with Linear Code

Feng GUO; Yoichiro WATANABE

Graph Associated with Linear Code

Feng GUO, Yoichiro WATANABE

Full Text Views

0

Cite this

Summary :

A graph associated with a linear code, which originates from a δ-decodable code pair for the two-user binary adder channel, is investigated based on the structure of the linear code. Subgraphs of the graph that are induced by cosets of the linear code are introduced. It is found that these are vertextransitive and are disconnected for uniquely decodable (1-decodable) code pair. Moreover, a class of graphs associated with linear codes is proved to consist of clique components and their independence numbers are successfully formulated. Applications to channel coding for the two-user binary adder channel are also discussed.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E74-A No.1 pp.49-53

Publication Date: 1991/01/25

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: Information Theory and Coding Theory

Authors

Feng GUO
Yoichiro WATANABE

Keyword

Cite this

Copy

Feng GUO, Yoichiro WATANABE, "Graph Associated with Linear Code" in IEICE TRANSACTIONS on Fundamentals, vol. E74-A, no. 1, pp. 49-53, January 1991, doi: .
Abstract: A graph associated with a linear code, which originates from a δ-decodable code pair for the two-user binary adder channel, is investigated based on the structure of the linear code. Subgraphs of the graph that are induced by cosets of the linear code are introduced. It is found that these are vertextransitive and are disconnected for uniquely decodable (1-decodable) code pair. Moreover, a class of graphs associated with linear codes is proved to consist of clique components and their independence numbers are successfully formulated. Applications to channel coding for the two-user binary adder channel are also discussed.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e74-a_1_49/_p

Copy

@ARTICLE{e74-a_1_49,
author={Feng GUO, Yoichiro WATANABE, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Graph Associated with Linear Code},
year={1991},
volume={E74-A},
number={1},
pages={49-53},
abstract={A graph associated with a linear code, which originates from a δ-decodable code pair for the two-user binary adder channel, is investigated based on the structure of the linear code. Subgraphs of the graph that are induced by cosets of the linear code are introduced. It is found that these are vertextransitive and are disconnected for uniquely decodable (1-decodable) code pair. Moreover, a class of graphs associated with linear codes is proved to consist of clique components and their independence numbers are successfully formulated. Applications to channel coding for the two-user binary adder channel are also discussed.},
keywords={},
doi={},
ISSN={},
month={January},}

Copy

TY - JOUR
TI - Graph Associated with Linear Code
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 49
EP - 53
AU - Feng GUO
AU - Yoichiro WATANABE
PY - 1991
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E74-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 1991
AB - A graph associated with a linear code, which originates from a δ-decodable code pair for the two-user binary adder channel, is investigated based on the structure of the linear code. Subgraphs of the graph that are induced by cosets of the linear code are introduced. It is found that these are vertextransitive and are disconnected for uniquely decodable (1-decodable) code pair. Moreover, a class of graphs associated with linear codes is proved to consist of clique components and their independence numbers are successfully formulated. Applications to channel coding for the two-user binary adder channel are also discussed.
ER -