Convolutional codes over groups
IEEE Transactions on Information Theory - Part 1
An efficient algorithm for constructing minimal trellises for codes over finite abelian groups
IEEE Transactions on Information Theory - Part 1
On behaviors and convolutional codes
IEEE Transactions on Information Theory - Part 1
Dynamical systems and convolutional codes over finite Abelian groups
IEEE Transactions on Information Theory - Part 1
Some structural properties of convolutional codes over rings
IEEE Transactions on Information Theory
System-theoretic properties of convolutional codes over rings
IEEE Transactions on Information Theory
Quaternary Convolutional Codes From Linear Block Codes Over Galois Rings
IEEE Transactions on Information Theory
Minimal Trellis Construction for Finite Support Convolutional Ring Codes
ICMCTA '08 Proceedings of the 2nd international Castle meeting on Coding Theory and Applications
Hi-index | 754.84 |
Convolutional codes are considered with code sequences modeled as semi-infinite Laurent series. It is well known that a convolutional code C over a finite group G has a minimal trellis representation that can be derived from code sequences. It is also well known that, for the case that G is a finite field, any polynomial encoder of C can be algebraically manipulated to yield a minimal polynomial encoder whose controller canonical realization is a minimal trellis. In this paper we seek to extend this result to the finite ring case G = Zpr by introducing a so-called "p-encoder". We show how to manipulate a polynomial encoding scheme of a noncatastrophic convolutional code over Zpr to produce a particular type of p-encoder ("minimal p-encoder") whose controller canonical realization is a minimal trellis with nonlinear features. The minimum number of trellis states is then expressed as pγ, where γ is the sum of the row degrees of the minimal p-encoder. In particular, we show that any convolutional code over Zpr admits a delay-free p-encoder which implies the novel result that delay-freeness is not a property of the code but of the encoder, just as in the field case. We conjecture that a similar result holds with respect to catastrophicity, i.e., any catastrophic convolutional code over Zpr admits a noncatastrophic p-encoder.