IEICE TRANSACTIONS on Fundamentals
Equivalent Conditions to Determine the GEKs by the LEKs in a Convolutional Network Code over a Cyclic Network
Summary :
In this paper, the correspondence between the weighted line graph and the Mason signal flow graph (MSFG) has been established, which gives an interpretation of a convolutional network code (CNC) over a cyclic network from a different perspective. Furthermore, by virtue of Mason theorem, we present two new equivalent conditions to evaluate whether the global encoding kernels (GEKs) can be uniquely determined by the given complete set of local encoding kernels (LEKs) in a CNC over a cyclic network. These two new equivalent conditions turn out to be more intuitive. Moreover, we give an alternative simple proof of an existing result.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E95-A No.9 pp.1570-1576
- Publication Date
- 2012/09/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E95.A.1570
- Type of Manuscript
- PAPER
- Category
- Coding Theory
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
Xubo ZHAO, Wangmei GUO, "Equivalent Conditions to Determine the GEKs by the LEKs in a Convolutional Network Code over a Cyclic Network" in IEICE TRANSACTIONS on Fundamentals,
vol. E95-A, no. 9, pp. 1570-1576, September 2012, doi: 10.1587/transfun.E95.A.1570.
Abstract: In this paper, the correspondence between the weighted line graph and the Mason signal flow graph (MSFG) has been established, which gives an interpretation of a convolutional network code (CNC) over a cyclic network from a different perspective. Furthermore, by virtue of Mason theorem, we present two new equivalent conditions to evaluate whether the global encoding kernels (GEKs) can be uniquely determined by the given complete set of local encoding kernels (LEKs) in a CNC over a cyclic network. These two new equivalent conditions turn out to be more intuitive. Moreover, we give an alternative simple proof of an existing result.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E95.A.1570/_p
Copy
@ARTICLE{e95-a_9_1570,
author={Xubo ZHAO, Wangmei GUO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Equivalent Conditions to Determine the GEKs by the LEKs in a Convolutional Network Code over a Cyclic Network},
year={2012},
volume={E95-A},
number={9},
pages={1570-1576},
abstract={In this paper, the correspondence between the weighted line graph and the Mason signal flow graph (MSFG) has been established, which gives an interpretation of a convolutional network code (CNC) over a cyclic network from a different perspective. Furthermore, by virtue of Mason theorem, we present two new equivalent conditions to evaluate whether the global encoding kernels (GEKs) can be uniquely determined by the given complete set of local encoding kernels (LEKs) in a CNC over a cyclic network. These two new equivalent conditions turn out to be more intuitive. Moreover, we give an alternative simple proof of an existing result.},
keywords={},
doi={10.1587/transfun.E95.A.1570},
ISSN={1745-1337},
month={September},}
Copy
TY - JOUR
TI - Equivalent Conditions to Determine the GEKs by the LEKs in a Convolutional Network Code over a Cyclic Network
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1570
EP - 1576
AU - Xubo ZHAO
AU - Wangmei GUO
PY - 2012
DO - 10.1587/transfun.E95.A.1570
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E95-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 2012
AB - In this paper, the correspondence between the weighted line graph and the Mason signal flow graph (MSFG) has been established, which gives an interpretation of a convolutional network code (CNC) over a cyclic network from a different perspective. Furthermore, by virtue of Mason theorem, we present two new equivalent conditions to evaluate whether the global encoding kernels (GEKs) can be uniquely determined by the given complete set of local encoding kernels (LEKs) in a CNC over a cyclic network. These two new equivalent conditions turn out to be more intuitive. Moreover, we give an alternative simple proof of an existing result.
ER -
English
