Abstract

A group code C over a group G is a set of sequences of group elements that itself forms a group under a component-wise group operation. A group code has a well-defined state space Sigma /sub k/ at each time k. Each code sequence passes through a well-defined state sequence. The set of all state sequences is also a group code, the state code of C. The state code defines an essentially unique minimal realization of C. The trellis diagram of C is defined by the state code of C and by labels associated with each state transition. The set of all label sequences forms a group code, the label code of C, which is isomorphic to the state code of C. If C is complete and strongly controllable, then a minimal encoder in controller canonical (feedbackfree) form may be constructed from certain sets of shortest possible code sequences, called granules. The size of the state space Sigma /sub k/ is equal to the size of the state space of this canonical encoder, which is given by a decomposition of the input groups of C at each time k. If C is time-invariant and nu -controllable, then mod Sigma /sub k/ mod = Pi /sub 1<or=j<or=v/ mod F/sub j//F/sub j-1/ mod /sup j/, where F/sub 0/ contained in ... contained in F nu is a normal series, the input chain of C. A group code C has a well-defined trellis section corresponding to any finite interval, regardless of whether it is complete. For a linear time-invariant convolutional code over a field G, these results reduce to known results; however, they depend only on elementary group properties, not on the multiplicative structure of G. Moreover, time-invariance is not required. These results hold for arbitrary groups, and apply to block codes, lattices, time-varying convolutional codes, trellis codes, geometrically uniform codes and discrete-time linear systems.<<ETX>>

Keywords

Group (periodic table)CombinatoricsMathematicsState (computer science)Group codeDiscrete mathematicsRealization (probability)Code (set theory)AlgorithmSet (abstract data type)Linear codePhysicsDecoding methodsComputer scienceBlock code

Affiliated Institutions

Related Publications

Geometrically uniform codes

A signal space code C is defined as geometrically uniform if, for any two code sequences in C, there exists an isometry that maps one sequence into the other while leaving the c...

1991 IEEE Transactions on Information Theory 450 citations

Codes on graphs: normal realizations

A generalized state realization of the Wiberg (1996) type is called normal if symbol variables have degree 1 and state variables have degree 2. A natural graphical model of such...

2001 IEEE Transactions on Information Theory 656 citations

Channel coding with multilevel/phase signals

A coding technique is described which improves error performance of synchronous data links without sacrificing data rate or requiring more bandwidth. This is achieved by channel...

1982 IEEE Transactions on Information Theory 3729 citations

Publication Info

Year
1993
Type
article
Volume
39
Issue
5
Pages
1491-1513
Citations
277
Access
Closed

External Links

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

277
OpenAlex

Cite This

G. David Forney, M.D. Trott (1993). The dynamics of group codes: state spaces, trellis diagrams, and canonical encoders. IEEE Transactions on Information Theory , 39 (5) , 1491-1513. https://doi.org/10.1109/18.259635

Identifiers

DOI
10.1109/18.259635