The Extended Invariant Factor Algorithm with Application to the Forney Analysis of Convolutional Codes
نویسنده
چکیده
In his celebrated paper on the algebraic structure of ConvoJutional codes, Forney 111 showed that by using the invariant-factor theorem, one can transform an arbitrary polynomial generator matrix for an (n, k ) convolutional code C into a basic (and ultimately a minimal) generator matrix for C. He also showed how to find a polynomial inverse for a basic generator matrix for C, and a basic generator matrix for the dual code CL. In this paper, we will discuss efficient ways to do aJ1 these things. Our main tool is the “entended invariant factor algorithm,” which we introduce here.
منابع مشابه
On the weight distribution of convolutional codes
Detailed information about the weight distribution of a convolutional code is given by the adjacency matrix of the state diagram associated with a controller canonical form of the code. We will show that this matrix is an invariant of the code. Moreover, it will be proven that codes with the same adjacency matrix have the same dimension and the same Forney indices and finally that for one-dimen...
متن کاملSubspaces of GF(q)^w and Convolutional Codes
In this paper we demonstrate that among all subspaces of GF(q) ! convolutional codes are best suited for error control purposes. To this end we regard several deening properties of convolutional codes and study the classes of subspaces deened by each of those properties alone. It turns out that these superclasses of the class of convolutional codes either achieve no better distance to rate rati...
متن کاملOn the Algebraic Parameters of Convolutional Codes with Cyclic Structure
In this paper convolutional codes with cyclic structure will be investigated. These codes can be understood as left principal ideals in a suitable skew-polynomial ring. It has been shown in [4] that only certain combinations of the algebraic parameters (field size, length, dimension, and Forney indices) can occur for such cyclic codes. We will investigate whether all these combinations can inde...
متن کاملOn the Parameters of Convolutional Codes with Cyclic Structure
In this paper convolutional codes with cyclic structure will be investigated. These codes can be understood as left principal ideals in a suitable skew-polynomial ring. It has been shown in [3] that only certain combinations of the parameters (field size, length, dimension, and Forney indices) can occur for cyclic codes. We will investigate whether all these combinations can indeed be realized ...
متن کاملSuperregular matrices and applications to convolutional codes
The main results of this paper are twofold: the first one is a matrix theoretical result. We say that a matriz is superregular if all of its minors that are not trivially zero are nonzero. Given a a × b, a ≥ b, superregular matrix over a field, we show that if all of its rows are nonzero then any linear combination of its columns, with nonzero coefficients, has at least a − b + 1 nonzero entrie...
متن کامل