| 1. |
- Forney, Jr., G David, et al.
(författare)
-
Minimal and canonical rational generator matrices for convolutional codes
- 1996
-
Ingår i: IEEE Transactions on Information Theory. - : Institute of Electrical and Electronics Engineers (IEEE). - 0018-9448. ; 42:6, Part 1, s. 1865-1880
-
Tidskriftsartikel (refereegranskat)abstract
- A full-rank IC x n matrix G(D) over the rational functions F(D) generates a rate R = k/n convolutional code C. G(D) is minimal if it can be realized with as few memory elements as any encoder for C, and G(D) is canonical if it has a minimal realization in controller canonical form. We show that G(D) is minimal if and only if for all rational input sequences p1 (D), the span of U (D) G (D) covers the span of ZL (D). Alternatively, G(D) is minimal if and only if G(D) is globally zero-free, or globally invertible. We show that G(D) is canonical if and only if G(D) is minimal and also globally orthogonal, in the valuation-theoretic sense of Monna.
|
|
| 2. |
- Johannesson, Rolf, et al.
(författare)
-
A linear algebra approach to minimal convolutional encoders
- 1993
-
Ingår i: IEEE Transactions on Information Theory. - : Institute of Electrical and Electronics Engineers (IEEE). - 0018-9448. ; 39:4, s. 1219-1233
-
Tidskriftsartikel (refereegranskat)abstract
- The authors review the work of G.D. Forney, Jr., on the algebraic structure of convolutional encoders upon which some new results regarding minimal convolutional encoders rest. An example is given of a basic convolutional encoding matrix whose number of abstract states is minimal over all equivalent encoding matrices. However, this encoding matrix can be realized with a minimal number of memory elements neither in controller canonical form nor in observer canonical form. Thus, this encoding matrix is not minimal according to Forney's definition of a minimal encoder. To resolve this difficulty, the following three minimality criteria are introduced: minimal-basic encoding matrix, minimal encoding matrix, and minimal encoder. It is shown that all minimal-basic encoding matrices are minimal and that there exist minimal encoding matrices that are not minimal-basic. Several equivalent conditions are given for an encoding matrix to be minimal. It is proven that the constraint lengths of two equivalent minimal-basic encoding matrices are equal one by one up to a rearrangement. All results are proven using only elementary linear algebra
|
|
| 3. |
- Johannesson, Rolf, et al.
(författare)
-
Some structural properties of convolutional codes over rings
- 1998
-
Ingår i: IEEE Transactions on Information Theory. - : Institute of Electrical and Electronics Engineers (IEEE). - 0018-9448. ; 44:2, s. 839-845
-
Tidskriftsartikel (refereegranskat)abstract
- Convolutional codes over rings have been motivated by phase-modulated signals. Some structural properties of the generator matrices of such codes are presented. Successively stronger notions of the invertibility of generator matrices are studied, and a new condition for a convolutional code over a ring to be systematic is given and shown to be equivalent to a condition given by Massey and Mittelholzer (1990). It is shown that a generator matrix that can be decomposed into a direct sum is basic, minimal, and noncatastrophic if and only if all generator matrices for the constituent codes are basic, minimal, and noncatastrophic, respectively. It is also shown that if a systematic generator matrix can be decomposed into a direct sum, then all generator matrices of the constituent codes are systematic, but that the converse does not hold. Some results on convolutional codes over Z(pe) are obtained
|
|
| 4. |
- Wan, Zhe-Xian, et al.
(författare)
-
On the construction of Cartesian authentication codes over symplectic spaces
- 1994
-
Ingår i: IEEE Transactions on Information Theory. - : Institute of Electrical and Electronics Engineers (IEEE). - 0018-9448. ; 40:3, s. 920-929
-
Tidskriftsartikel (refereegranskat)abstract
- Various constructions of authentication codes using spaces related to the general linear group have been proposed and analyzed. In the paper the authors describe two new constructions of Cartesian authentication codes using symplectic spaces. This illustrates the feasibility of codes from spaces based on geometries of the other classical groups.
|
|
