The Characteristic Generators for a Group Code

Haibin KAN  Xuefei LI  Hong SHEN  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E89-A   No.5   pp.1513-1517
Publication Date: 2006/05/01
Online ISSN: 1745-1337
DOI: 10.1093/ietfec/e89-a.5.1513
Print ISSN: 0916-8508
Type of Manuscript: LETTER
Category: Coding Theory
basic spans,  biproper p-basis,  characteristic generators,  conventional trellises,  tail-biting trellises,  

Full Text: PDF>>
Buy this Article

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.