1 Introduction
Convolutional codes are a powerful tool that is used to correct digital data. These error correcting codes are applied in numerous situations such as the communications with the deep space, the mobile communications or the hard decision codes. Regarding cybersecurity, convolutional codes are applied in several areas in order to improve the efficiency and security of different processes. For instance, these codes are used in cryptography to construct cryptosystems (see [1]). They are also employed in [2] as an alternative scheme that avoids the need for global connection in the modeling of networks by trellis representations. On the other hand, concatenated convolutional codes, developed in [3], have been strongly exploited when it is necessary to transmit and hide sensitive information. Recent advances in parallel and serial concatenated convolutional codes focus on their implementation in the construction of turbo codes.
The connection between linear systems and convolutional codes over finite fields has been studied from different points of view depending on the approach to convolutional codes that is being used (see [4]). The available representations let us describe the dynamics of the encoders of the codes or constructing convolutional codes with certain good properties such as observability. Recently, the study of convolutional codes over finite fields has been developed through these relations based on first order representations and input/state/output (I/S/O) representations and references therein [5, 6, 7, 8].
Although the study of error-correcting codes initially started over finite fields, the research of codes over rings has increased due to the applications and properties of these codes. For example, in [9] an encoder over ℤ/4ℤ is developed for decoding MPEG-4 images. Recently, in [10], a steganographic protocol has been performed based on convolutional codes over the ring ℤ/4ℤ.
Convolutional codes over rings were introduced by Massey and Mittleholzer in [11] and [12]. They also focused on the study of minimal and systematic encoders over rings. However, convolutional codes over rings do not behave in the same way as convolutional codes over fields because their behavior depends strongly on the structure of the underlying ring. The study of properties, encoders, p-basis and dual convolutional codes over finite rings, has been developed in [13, 14, 15, 16] among others. In [17], a bound on the free distance of convolutional codes over ℤpr was developed generalizing the results described in [7]. A construction of nonfree MDS convolutional codes over ℤpr is also given in [18] with new upper-bounds on the free distance.
The extension of the duality between linear systems and convolutional codes is not easily generalized to all commutative rings with identity. It depends strongly on the ring and the realization theory that we will want to extend. This paper is based on the generalization given in [19, 20] of the theory studied in [21, 22, 23] about the connection between linear systems (reachable input/state/output representations) and convolutional codes (with finite support). The extension developed in [19, 20] let us construct observable families of convolutional codes over a finite ring R. We consider noetherian von Neumann regular rings: that is, finite products of fields. In particular, we suppose that R≃𝔽1 × 𝔽2 × … × 𝔽t ≃
More precisely, these families of convolutional codes over R allow us to construct an algebraic system of simultaneous signal encoding in linear coding networks over the ring R, improving the security of the system. This system lets us send the same message m encoded over the ring R to several receivers and every receiver decodes its message μj over 𝔽j = R / 𝔪j where 𝔪j is the j-th maximal ideal in the spectrum of R. In this situation, if the messages over 𝔽j are shared, it would be possible to create the original message that we assume unique: m = (μ1, …, μt). In this case, a finite base of t communication systems is used, so that the message is encoded over the ring R (see Figure 1). Moreover, a continuous net among receivers is not needed. In cybersecurity framework, this multicast encoding could be applied to effective coding in the cloud where many agents would use the same cloud resources to different purposes and several scripts.

Diagram of communications
Citation: Open Mathematics 15, 1; 10.1515/math-2017-0124
On the other hand, feedback equivalence of linear systems over commutative rings is one of the main holistic matters in science and engineering (see [24, 25, 26]). Two linear systems are feedback equivalent if one can transform one into the other by changes of coordinates together with feedback loops. Regarding equivalence relations in coding literature, due to the fact that a convolutional code can have many encoders, most works on the topic are focused on the study of equivalence relations between encoders of the same convolutional code: that is, the study of the conditions in which two encoding matrices are equivalent, and thus they generate the same code (see [4] for a general overview). In the theory of block codes over finite fields, MacWilliams stated that linear block codes are related by weight-preserving isomorphism (see [27]). However, the weight enumerator does not form a complete invariant under monomial equivalence. In [28], a generalization of the above theory for certain convolutional codes over finite fields is given by making use of classical realization theory (driving representation of the code). They proved that all minimal realizations of a given code are feedback equivalent in the sense that the adjacency matrix of reduced encoders turns into an invariant of the code. Regarding linear codes over finite Frobenius rings, the theorem of monomial equivalence of MacWilliams is extended in [29].
In this paper, we use the study of feedback isomorphisms of linear systems over commutative rings (see [30, 31, 32]) to define a feedback convolutional equivalence for families of convolutional codes over a noetherian von Neumann regular ring R. The key is that the set of Kronecker indices of both objects (partitions of the rank of the state space of the system and the complexity of the code) forms a complete family of invariant elements under feedback isomorphism. Moreover, the relation between locally Brunovsky linear systems and families of convolutional codes over R by I/S/O representations allows us to know how many equivalence classes of families of convolutional codes there are with the same Kronecker’s indices; i.e. with the same degree under feedback convolutional equivalence. Note that this feedback equivalence relation is valid in the case of finite fields.
This paper is organized as follows: In Section 2 we give the related work with the basic results of linear systems, convolutional codes and the relation between them. In Section 3 we give our main results supported by examples. Finally, we give the conclusions, future work and references.
2 Preliminaries
The first part of this section is devoted to basic preliminaries about linear systems over rings and some important properties such as reachability and observability. In the second part, we give a review of convolutional codes over finite fields and their connection with linear systems. Finally, we give an overview of the theory of families of convolutional codes over rings and the I/S/O representation considered in this paper.
2.1 Linear systems and feedback isomorphisms over rings
where xt ∈ Rδ is the state vector, ut ∈ Rk is the control vector, and yt ∈ Rp is the output vector for each time instant t. The dimension of the state space δ is known as the dimension of the linear system.
and thus, we can consider the dynamical system Σ = (A, B) over R.
We review some results about reachability (controllability from the origin) properties of linear systems over R. In the case of time-invariant systems, the reachability of a system refers to the ability of the system to reach x1 from the origin in some finite time. We review the main characterization of the reachability of a time-invariant linear system in terms of the pair (A, B).
(c.f. [25] and [33]). Let Σ be a linear system over R. The following statements are equivalent
- Σ is reachable.
- The columns of Φδ = (B AB … Aδ−1 B) generate Rδ.
- The map ϕ : Rkδ → Rδ given by multiplication by Φδ is residually surjective at each maximal ideal 𝔪 of R.
- The ideal 𝓤δ(Φδ) generated by the δ × δ minors of Φδ equals R.
- The map (zI – A, B): R[z]δ+k → R[z]δ is surjective (generalization of Hautus Test).
State observability is the ability to determine the state vector of the system knowing the input and the corresponding output over some finite time interval. The following result describes observability properties in terms of the pair of matrices (A, C) of the system.
(c.f. Theorem 2.6, [25]). Let Σ be a linear system over R. The following statements are equivalent
- Σ is observable.
- Let Ωδ = [C, CA, …, CAδ−1]t be the observability matrix. Then rank (Ωδ) = δ.
- The map τ : Rδ → Rpδ given by multiplication by Ωδ is injective.
- If 𝓤δ(Ωδ) is the ideal of R generated by the δ × δ minors of Ωδ, then, the annihilator of 𝓤δ(Ωδ) is zero.
On the other hand, it is known that two linear systems over a field 𝕂 are feedback equivalent when they have a similar feedback dynamical behavior (they have the same feedback invariant elements).
The set of indices described in Equation (2) is a complete family of invariants of reachable linear systems under the group of feedback transformations. If we reorder them, then they are equal to the Kronecker’s minimal column indices for the matrix pencil (zI – A, B) associated to Σ. We denote them by 𝓚Σ = (𝓚1, …, 𝓚p). The set 𝓚Σ is called the set of control invariants of Σ. Moreover, Kronecker indices (𝓚1 ≥ 𝓚2≥ ⋯ ≥ 𝓚p) form an ordered partition of the integer δ, the dimension of the system; that is, δ = 𝓚1 + … + 𝓚p. And then, fe𝕂(δ) is equal to the number of partitions of the integer δ, pℕ(δ).
We recall that both sets of indices {ξi} and {𝓚i} are conjugated with each other (see [35]). Note that computing the Kronecker’s indices of a dynamical linear system by the computation of the conjugated invariant elements is, in some cases, easier than the direct computation. We can use Young’s diagram.
Therefore, ξΣ = (1, 1). We can represent these indices by the Young’s diagram and thus, we transpose the diagram in order to compute the Kronecker indices, then 𝓚Σ = (κ1, κ2) = (2, 0), see Table 1.
Kronecker’s indices in ℤ/2ℤ by Young’s diagrams.
Conjugate Kronecker’s Indices | Kronecker’s Indices |
---|---|
([32]). Let Σ and Σ′ be a couple of linear systems over R. Σ is feedback isomorphic with Σ′ ⇔ there exists an isomorphism ϕ : X → X′ such that ϕ(B) = B′ and Im(ϕf – f′ϕ) ⊂ B′.
The existence of feedback invariants for Σ is studied in [30, 31, 32], for a specific type of systems: locally Brunovsky linear systems (systems having locally a Brunovsky Canonical Form). In this case, the invariant modules Ni = B + f(Ni−1), Mi = X / Ni and Ii = Ni / Ni−1 are extended to the invariant modules Zi = Ker (Ii → Ii+1) which form a complete family of invariant elements.
If we consider linear systems over a noetherian von Neumann regular ring R, by Proposition 4.2 in [36], we can perform the computation of the number of classes of feedback isomorphisms of locally Brunovsky linear systems over R where X ≃ Rδ, which is equal to feR(m) = feR(δ) = [pℕ(δ)]#Spec(R).
In the case of linear systems over commutative rings, we recall that
If R is a von Neumann regular ring, we also have available a characterization of the ring R in terms of reachability and locally Brunovksy properties of linear systems over the ring.
(cf. Theorem 3.2 in [36]). Let R be a commutative ring with identity. Let Σ be a linear system over R where X is a finitely generated R-module. Then the following are equivalent
- R is a von Neumann regular ring.
- Σ is reachable if and only if Σ is a locally Brunovsky linear system.
2.2 Convolutional codes and linear systems
In literature regarding codes, one can find different definitions for a convolutional code over a finite field that are related, in different ways, with linear systems, see [4]. We have available the linear algebra point of view in which a convolutional code is a linear subspace and its associated linear system was given by Massey and Sain (see [37] and [38]). It is known as driving input/output representation. Another approach to convolutional codes over finite fields is the symbolic dynamics point of view. In this case, a convolutional code is a linear compact irreducible and shift invariant subset of 𝔽n[z, z−1] and the relation with linear systems is given in [39], among others. Also, convolutional codes can be defined as a class of time-invariant and complete behavior in the sense of Willems [40], and there is a realization theory too (see [41, 42]).
We are interested in the module-theoretical approach of convolutional codes that requires that the codewords have finite support (see [43]). We consider that a rate
The above relation is extended to noetherian von Neumann regular rings in [19, 20]. We are going to recall the main results of this generalization:
such that Im G(z) = 𝕮 and G(z) is injective.
where G′(z) ∈ R(z)(n−k)×k. The encoder G(z) is systematic if we can find a k × k minor in G(z), W(z), such that W(z) ∈ Units (R(z)).
If we can consider a systematic encoder for a family of convolutional codes 𝕮, then all encoder of the family of codes will be systematic and thus, we say that 𝕮 is a systematic family of convolutional codes.
Fix δ ∈ ℕ. A family of convolutional codes over R, 𝕮, is said to be of degree δ if its degree function (4) is constant and equal to δ.
In the sequel, we focus on an (n, k, δ) - systematic family of convolutional codes, 𝕮, over a noetherian von Neumann regular ring R. Since R is zero dimensional and noetherian, Spec(R) is a finite set of prime ideals. Moreover, every prime ideal is maximal and then Spec(R) = {𝔪1, …, 𝔪t}. We denote 𝔽j : = R / 𝔪j. Thus we can consider an (n, k, δ) convolutional code, 𝓒j, over each 𝔽j.
- The condition imposed over Coker(G(z)) of being R-flat can be translated into some algebraic conditions on the entries of G(z). However, in case R is a von Neumann regular ring these conditions are superfluous, since every R-module is flat, ie., in this case, any encoder G(z) satisfies this condition.
- Note that if G(z) is a systematic encoder of 𝕮 in R, then the encoders of each 𝓒j, Gj(z), are systematic too. The inverse does not hold true, in general.
and satisfying that the code is described by Ker(zK + L |M) ≃ 𝕮.
Moreover, the above matrices satisfy minimality conditions:
- K has column full size rank.
- (K | M) has row full size rank.
- Map (zK + L | M) defined by (zK + L | M) : R[z]δ+n → R[z]δ+n−k is surjective.
where xt ∈ Rδ is the state vector, ut ∈ Rk is the information vector, yt ∈ Rp is the parity vector and vt is a codeword of 𝕮 for each time instant t. We assume that vt is a finite-weight codeword and the code sequence has finite weight. Note that this I/S/O representation is different from the driving representation given in [38].
and
Note that the triple of matrices (K, L, M) can be constructed through φrs by taking Kj ≡ K (mod Ij), Lj ≡ L (mod Ij) and Mj ≡ M (mod Ij) where (Kj, Lj, Mj) is a minimal first order representation of 𝓒j for each 𝔽j.
In a similar way, we can obtain Σ𝕮 over R by patching Σ𝓒j, the I/S/O representations of the convolutional codes 𝓒j over each 𝔽j.
Regarding control properties, by Proposition 2.1 the minimality condition 3) of the first order representation of a family of convolutional codes is actually equivalent to say that Σ𝕮 is a reachable linear system.
By [21] every Σj is a reachable linear system over 𝔽j. Thus,Σ over R is residually surjective. By Proposition 2.1, Σ is reachable over R.
In addition, if Σ𝕮 = (A, B)𝕮 is the dynamical part of an I/S/O representation of a family of convolutional codes, 𝕮, over R, then Σ𝕮 is a locally Brunovsky linear system over R by [36]. So it verifies all properties of feedback isomorphism of linear systems described in Subsection 2.1.
An essential property of convolutional codes over finite fields constructed by I/S/O representations as described in Equation (7) is the observability:
(c.f. Lemma 3.3.2, [23]). Let 𝓒 ⊂ 𝔽[z]n be an (n, k, δ)-convolutional code. It is observable if there exists a syndrome Former ψ : 𝔽[z]n ↠ 𝔽[z]n−k such that Ker(ψ) = 𝓒.
Note that the above property is equivalent to say that a convolutional code 𝓒 is observable if the quotient 𝔽[z]n/𝓒 is a flat 𝔽[z]-module. Lemma 2.11 in [22] ensures that 𝓒(Σ) is observable (non-catastrophic convolutional encoder) if and only if Σ𝓒 is an observable linear system. Note that Σ is also reachable by minimality conditions.
Moreover, the generalization of the above lemma is given in [19] and [20] and it is as follows: if we consider a reachable and observable linear system Σ over R, then 𝕮 (Σ) is an observable family of convolutional codes in the sense that R[z]n/ 𝕮 is flat over R[z].
3 Feedback convolutional equivalence over noetherian von Neumann regular rings
Before defining the feedback convolutional equivalence between families of convolutional codes, we recall some results above the degree and the controllability indices of convolutional codes over finite fields (see [23]). These results will be used in the sequel:
- The degree of the encoder G(z) of a convolutional code 𝓒 over a finite field, that is denoted by δ(G(z)), is defined by their column degrees, νi := max{deg (gi,j(z) where i = 1, …, n}, as δ(G(z)): =
νl. - The complexity of a convolutional code 𝓒, denoted by δ(𝓒), is defined as the highest degree of the full size minors of any encoder G(z).
- An encoder matrix G(z) of 𝓒 is minimal if and only if δ(G(z))= δ (𝓒).
- The set of column degrees of any minimal encoder of 𝓒 are known as the Forney or controllability indices of the code. We can reorder them if it is necessary such that κ1 ≥ … ≥ κk. The invariant δ =
κi is the degree of the code 𝓒. The complexity of a convolutional code over a finite field equals its degree. In the following, we denote the set of controllability indices by 𝔎𝓒 = (κ1, …, κk). - Note that the controllability indices of a convolutional code are unique and invariants of the code.
Forney or controllability indices are known, in the case of minimal encoders, as the Kronecker indices of the code. In the sequel, by abuse of notation we call them controllability indices of the code.
Since by first order representation we can compute an I/S/O representation for a convolutional code 𝓒 ([21, 22, 23]), the relation between controllability indices of the code and controllability (reachability) indices of the I/S/O representation associated as dynamical linear system is clear and it is given in the following theorem:
(c.f. Theorem 2, [44].). If Σ = (A, B) forms a controllable pair such that A ∈ 𝔽δ×δ and B ∈ 𝔽δ×k, then there exist positive integers κ1 ≥ … ≥ κk (often referred to as the controllability or Kronecker indices of the pair Σ) only dependent on the GLδ equivalence class of Σ having the following properties:
- κ1 = κ, the controllability index of Σ.
κi = δ, the size of matrix A.- There exists polynomial matrices X(z), Y(z), U(z) satisfying
and having the property that the i-th column degree of G(z) =
is equal to κi, and the ith column degree of X(z) is equal to κi − 1 for i = 1, …, k.
Since I/S/O representations over a finite field allow us to represent a convolutional code as 𝓒 ≃ Ker(zK + L | M) =
whose controllability indices are 𝔎𝓒 = (κ1, κ2) = (2, 0).
From the above triple of matrices, we compute its I/S/O representation Σ𝓒 that is equal to the system Σ obtained in the Example 2.3. Thus 𝓚Σ𝓒 = (κ1, κ2)=(2,0).
Let R be a noetherian von Neumann regular ring. Let 𝕮 ≃
where
By definition of 𝕮 every convolutional code 𝓒j has the same number of controllability indices, k, and
where
and then ξ1 = rk(B2) = 2 and ξ2 = rk (B2 A2B2) − rk(B2) = 2 − 2 = 0. So, by Table 2, 𝓚Σ𝓒2 = [1, 1].
Kronecker’s indices over ℤ/3ℤ
Conjugate Kronecker’s Indices | Kronecker’s Indices |
---|---|
Now we define the feedback convolutional relation between families of convolutional codes over a noetherian von Neumann regular ring R.
Note that f.c.e. is an equivalence relation.
The number of feedback equivalence classes of a systematic family of convolutional codes with degree δ under feedback equivalence is pℕ (δ)t where pℕ(δ) denotes the number of partitions of the degree of the codes.
Feedback equivalence classes of a family of convolutional codes 𝕮 such that the components of their controllability indices verify
where p(δ) denotes the partitions of integer δ.
We give our main result.
where f.i denotes the feedback isomorphism between locally Brunovsky linear systems with state space of rank δ and Σ𝕮 = (A, B)𝕮 (respectively for
where {Br(R)} denotes the set of locally Brunovsky linear systems over R with state space of rank δ, ∼ denotes the feedback isomorphism, and Σ𝕮 = (A, B)𝕮 (respectively for
By Lemma 3.9, # { feedback classes of 𝕮 } = p(δ)t and since R is a noetherian von Neuman regular ring, this number is equal to feR(δ), so we conclude the proof.□
Note that Kronecker indices of a linear system Σ are obtained from the pair (A, B) and hence, they are independent of C and D. Therefore, since controllability invariant indices of an (n, k, δ) - family of convolutional codes, 𝕮, are obtained from its I/S/O representation Σ𝕮, it follows that controllability indices of 𝕮 are obtained from pair (A, B)𝕮, and they are independent of (C, D)𝕮. We highlight this property in the following example.
4 Conclusions and future work
We conclude that there exists a bijective correspondence between feedback isomorphisms of locally Brunovksy linear systems and feedback convolutional classes of families of convolutional codes over a noetherian von Neumann regular ring R.
Future work is focused on the construction of canonical forms of families of convolutional codes by using Brunovsky canonical forms of their associated I/S/O representations over R as well as the development of the decoding process. Moreover, we will study the generalization of the feedback convolutional equivalence to other interesting classes of rings. From an engineering point of view, it would be interesting to perform algorithms in order to get effective computations of multicast convolutional coding depicted in this paper.
References
- [1]↑
Climent J.J., Herranz V., Perea C., Tomás V., Un criptosistema de clave pública basado en códigos convolucionales, In Proceedings of XXI Congreso de Ecuaciones Diferenciales y Aplicaciones & XI Congreso de Matemática aplicada (21-25 Septiembre, Ciudad Real, Spain), 2009, 1-8.
- [2]↑
Petsche, T., Dickinson B. W., A Trellis - structured Neural Network, Neural Infor. Proc. Systems, 1988, 592 - 601.
- [4]↑
Rosenthal J., Codes, systems and graphical models, IMA, vol. 123, ch. Connections between linear systems and convolutional codes, Springer - Verlag, 2001, 39 - 66,
- [5]↑
García-Planas M.I., Souidi El.M., Um L.E., Convolutional codes under linear systems point of view. Analysis of output-controllability. Wseas Transactions on Mathematics, 2012, 11 (4), 324-333.
- [6]↑
Climent J-J., Herranz V., Perea C., A first approximation of concatenated convolutional codes from linear systems theory viewpoint, Linear Algebra Appl., 2007, 425 ( 2-3), 673-699.
- [7]↑
Rosenthal J., Smarandache R., Maximum distance separable convolutional codes, Appl. Algebr. Eng. Comm., 1999, 10 (1), 15-32.
- [8]↑
Zerz E., On multidimensional convolutional codes and controllability properties of multidimensional systems over finite rings, Asian J. Control, 2010, 12 (2), 119-126.
- [9]↑
Mahapakulchai S., Van Dyck R., Design of ring convolutional trellis codes for MAP decoding of MPEG-4 images, IEEE Trans.Commun., 2004, 52 (7), 1033 -1037.
- [10]↑
Jouhari H., Souidi E. M., Improving Embedding Capacity by using the Z4-linearity of Preparata Codes. Int J Comput Appl., 2012, 53 (18), 1-6.
- [11]↑
Massey J.L., Mittelholzer T., Convolutional codes over rings, In Proceedings Joint Swedish-Soviet Int. Workshop on Inform. Theory, (Gotland, Sweeden), 1989, 14-18.
- [12]↑
Massey J.L., Mittelholzer T., Systematicity and rotational invariance of convolutional codes over rings. In Proceedings Int. Workshop on Alg. and Combinatorial Coding Theory (Leningrad, Russia),1990, 154-158.
- [13]↑
Fagnani, F., Zampieri S., System-theoretic properties of convolutional codes over rings, IEEE T. Infor. Theory, 2001, 47 (6), 2256-2274.
- [14]↑
Johannesson R., Wan Z., Wittenmark E., Some structural properties of convolutional codes over rings, IEEE T. Infor. Theory, 1998, 44 (2), 839-845.
- [15]↑
Kuijper M., Pinto R., On minimality of convolutional ring encoders, IEEE T. Inform. Theory, 2009, 55 (11), 4890-4897.
- [16]↑
El Oued M., Napp D., Pinto R., Toste M., The dual of convolutional codes over Zpr. volume entitled Applied and Computational Matrix Analysis. Springer Verlag, 2017, 192, 79–91.
- [17]↑
El Oued M., Sole P., MDS convolutional codes over a finite ring. IEEE T. Inform. Theory.,2013, 59 (11), 7305 –7313.
- [18]↑
Napp D., Pinto R., Toste M., On MDS convolutional codes over Zpr, Des. Codes Cryptogr., 2017, 83, 101–114.
- [19]↑
Carriegos M., DeCastro-García N., Muñoz Castañeda A., Kernel representations of convolutional codes over rings, Preprint available in https://arxiv.org/pdf/1609.05043v1.pdf, unpublished data.
- [20]↑
DeCastro-García N., Feedback equivalence in linear systems and convolutional codes. Applications to Cybernetics, Coding and Cryptography, Ph. D. DThesis, Universidad de León, Spain, 2016.
- [21]↑
Rosenthal J., Schumacher, J. M., York E. V., On behaviors and convolutional codes, IEEE T. Inform. Theory, 1996, 42 (6), 1881-1891.
- [22]↑
Rosenthal J., York E. V., BCH Convolutional Codes, IEEE T. Inform. Theory, 1999, 45 (6), 1833-1844,
- [23]↑
York E. V., Algebraic description and construction of error correcting codes, a systems theory point of view, Ph.D. thesis, Univ. Notre Dame, France, 1997.
- [24]↑
Brewer J. W., Klingler L., On feedback invariants for linear dynamical systems, Linear Algebra Appl., 2001, 325 (1-3), 209-220.
- [25]↑
Brewer J. W., Bunce J. W., Van Vleck F. S., Linear Systems over Commutative Rings, Marcel Dekker, New York, 1986.
- [26]↑
Hautus M.L.J., Sontag E.D., New results on pole-shifting for parametrized families of systems, J. Pure Appl. Algeb, 1986, 40, 229-244.
- [27]↑
MacWilliams F. J., A theorem on the distribution of weights in a systematic code. Bell Syst. Tech. J., 1963, 42, 79–94.
- [28]↑
Gluesing-Luerssen H., Schneider G., State space realizations and monomial equivalence for convolutional codes, Linear Algebra Appl., 2007, 425 (2-3), 518-533.
- [29]↑
Quang Dinh H., Łódź-Permouth S. R., On the equivalence of codes over rings and modules, Finite Fields Th. App., 2004, 10, 615–625.
- [30]↑
Carriegos M., Hermida-Alonso J.A., Sánchez-Giralda T., The pointwise feedback relation for linear dynamical systems, Linear Algebra Appl., 1998, 279 (1-3), 119-134.
- [31]↑
Hermida-Alonso J.A., Perez M.P., Sanchez-Giralda T., Brunovsky's canonical form for linear dynamical Systems over commutative rings, Linear Algebra Appl., 1996, 233, 131-147.
- [32]↑
Carriegos M. V., Enumeration of classes of linear systems via equations and via partitions in a ordered abelian monoid, Linear Algebra App., 2013, 438 (3), 1132-1148.
- [33]↑
Hautus M.L.J., Controllability and observability condition for linear autonomous system. Ned. Akad. Wetenschappen, Proc. Ser. A, 1969, 72, 443-448.
- [34]↑
Brunovsky P. A., A classification of linear controllable systems, Kibernetika, 1970, 6 (3), 173-187.
- [35]↑
Kalman R. E., Kronecker invariants and Feedback, in Ordinary Differential Equations, Academic Press (New York), 1972, 459-471.
- [36]↑
DeCastro-García N., Carriegos M.V., Muñoz Castañeda A., A characterization of von Neumann rings in terms of linear systems, Linear Algebra App., 2016, 494, 236-244.
- [37]↑
McEliece R. J., The algebraic theory of convolutional codes. In V. Pless and W.C. Huffman, editors, Handbook of Coding Theory, 1998, 1, 1065-1138.
- [38]↑
Massey J.L., Sain M.K., Codes, automata and continuous systems: explicit interconnections, IEEE Trans. Automat. Contr., 1967, 12 (6), 644–650.
- [39]↑
Kitchens B. Symbolic Dynamics and Convolutional Codes. In: Marcus B., Rosenthal J. (eds) Codes, Systems, and Graphical Models. The IMA Volumes in Mathematics and its Applications, Springer, New York, NY, 2001, 123.
- [40]↑
Willems J. C., From time series to linear system-part I. Finite dimensional linear time invariant systems, Automatica (Journal of IFAC), 1986, 22 (5), 561-580.
- [41]↑
Kuijper M., First Order Representations of Linear Systems, Ph.D. Thesis, Boston, MA: Birkhäuser, 1994
- [42]↑
Kuijper M., Schumacher J. M., Realization of Autoregressive Equations in Pencil and Descriptor Form, SIAM J. Control Optim., 1990, 28 (5), 1162-1189.
- [43]↑
Fornasini, Valcher M.E., Multidimensional systems with finite support behaviors, Signal structure generation and detection, SIAM J. Control Op., 1998, 36(2), 760 779.
- [44]↑
Popov V. M., Invariant description of linear time-invariant controllable systems, SIAM J. Control Opl, 1972, 10 (2), 252-264.