The characteristic generators for a group code

Haibin Kan, Xuefei Li, Hong Shen

Research output: Contribution to journalArticlepeer-review

7 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)1513-1517
Number of pages5
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Issue number5
Publication statusPublished - May 2006
Externally publishedYes


  • Basic spans
  • Biproper p-basis
  • Characteristic generators
  • Conventional trellises
  • Tail-biting trellises


Dive into the research topics of 'The characteristic generators for a group code'. Together they form a unique fingerprint.

Cite this