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.
Original language | English |
---|---|
Pages (from-to) | 1513-1517 |
Number of pages | 5 |
Journal | IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences |
Volume | E89-A |
Issue number | 5 |
DOIs | |
Publication status | Published - May 2006 |
Externally published | Yes |
Keywords
- Basic spans
- Biproper p-basis
- Characteristic generators
- Conventional trellises
- Tail-biting trellises