In this letter, we discussed some properties of characteristic generators for a finite Abelian group code, proved that any two characteristic generators can not start (end) at the same position and have the same order of the starting (ending) components simultaneously, and that the number of all characteristic generators can be directly computed from the group code itself. These properties are exactly the generalization of the corresponding trellis properties of a linear code over a field.
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.
Copy
Haibin KAN, Xuefei LI, Hong SHEN, "The Characteristic Generators for a Group Code" in IEICE TRANSACTIONS on Fundamentals,
vol. E89-A, no. 5, pp. 1513-1517, May 2006, doi: 10.1093/ietfec/e89-a.5.1513.
Abstract: In this letter, we discussed some properties of characteristic generators for a finite Abelian group code, proved that any two characteristic generators can not start (end) at the same position and have the same order of the starting (ending) components simultaneously, and that the number of all characteristic generators can be directly computed from the group code itself. These properties are exactly the generalization of the corresponding trellis properties of a linear code over a field.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e89-a.5.1513/_p
Copy
@ARTICLE{e89-a_5_1513,
author={Haibin KAN, Xuefei LI, Hong SHEN, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={The Characteristic Generators for a Group Code},
year={2006},
volume={E89-A},
number={5},
pages={1513-1517},
abstract={In this letter, we discussed some properties of characteristic generators for a finite Abelian group code, proved that any two characteristic generators can not start (end) at the same position and have the same order of the starting (ending) components simultaneously, and that the number of all characteristic generators can be directly computed from the group code itself. These properties are exactly the generalization of the corresponding trellis properties of a linear code over a field.},
keywords={},
doi={10.1093/ietfec/e89-a.5.1513},
ISSN={1745-1337},
month={May},}
Copy
TY - JOUR
TI - The Characteristic Generators for a Group Code
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1513
EP - 1517
AU - Haibin KAN
AU - Xuefei LI
AU - Hong SHEN
PY - 2006
DO - 10.1093/ietfec/e89-a.5.1513
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E89-A
IS - 5
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - May 2006
AB - In this letter, we discussed some properties of characteristic generators for a finite Abelian group code, proved that any two characteristic generators can not start (end) at the same position and have the same order of the starting (ending) components simultaneously, and that the number of all characteristic generators can be directly computed from the group code itself. These properties are exactly the generalization of the corresponding trellis properties of a linear code over a field.
ER -