Feedback equivalence of convolutional codes over finite rings

Noemí DeCastro-García

doi:10.1515/math-2017-0124

Article Open Access

Feedback equivalence of convolutional codes over finite rings

Noemí DeCastro-García

Published/Copyright: December 29, 2017

Published by

Become an author with De Gruyter Brill

Submit Manuscript Author Information Explore this Subject

$Open Mathematics$

From the journal Open Mathematics Volume 15 Issue 1

Abstract

The approach to convolutional codes from the linear systems point of view provides us with effective tools in order to construct convolutional codes with adequate properties that let us use them in many applications. In this work, we have generalized feedback equivalence between families of convolutional codes and linear systems over certain rings, and we show that every locally Brunovsky linear system may be considered as a representation of a code under feedback convolutional equivalence.

Keywords: Convolutional codes; Linear systems; Feedback equivalence; Finite rings; Coding theory

MSC 2010: 94B10; 93C05; 13C10; 93B20

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 ℤ_p^r was developed generalizing the results described in [7]. A construction of nonfree MDS convolutional codes over ℤ_p^r 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≃𝔽₁ × 𝔽₂ × … × 𝔽_t ≃ ⊕j=1t 𝔽_j where 𝔽_j is a finite field.

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 = (μ₁, …, μ_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.

$Figure 1 Diagram of communications$

Figure 1

Diagram of communications

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

Let R be a commutative ring with identity. A time-invariant linear system Σ = (A, B, C, D) ∈ R^δ×δ × R^δ×k × R^p×δ × R^p×k is described as follows

xt+1=Axt+Butyt=Cxt+Dut, (1)

where x_t ∈ R^δ is the state vector, u_t ∈ R_k is the control vector, and y_t ∈ R^p is the output vector for each time instant t. The dimension of the state space δ is known as the dimension of the linear system.

The generalization of linear systems over a commutative ring with identity R starts from considering a triple Σ = (X, f, 𝓑) where X is an R-module of rank δ (state space of the system), f : X → X is an endomorphism of X, and 𝓑 is a finitely generated submodule of X (see [26]). When X ≃ R^δ, then a pair of matrices (A, B) ∈ R^δ×δ × R^δ×k gives a linear map as the one described above by the assignment

(A,B)↦(Rδ,A,B:=Im(B))

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 x₁ 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).

Proposition 2.1

(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 ϕ : R^kδ → 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.

Proposition 2.2

(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^δ → R^pδ 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).

By [34] and [35], feedback classification of dynamical linear systems over a field 𝕂 becomes the feedack classification of reachable systems and thus, we can compute the number of feedback equivalence classes of dynamical linear systems over a δ-dimensional 𝕂-vectorial space, fe_𝕂(δ), by the classification of reachable systems. The number of feedback classes of δ-dimensional reachable systems over 𝕂 may be computed by using the indices (ξ₁, ξ₂, …, ξ_p) where

ξ1=rk(B) and ξi=rk(B,AB,…,Ai−1B)−rk(B,AB,…,Ai−2B). (2)

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 𝓚^Σ = (𝓚₁, …, 𝓚_p). The set 𝓚^Σ is called the set of control invariants of Σ. Moreover, Kronecker indices (𝓚₁ ≥ 𝓚₂≥ ⋯ ≥ 𝓚_p) form an ordered partition of the integer δ, the dimension of the system; that is, δ = 𝓚₁ + … + 𝓚_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.

Example 2.3

Let Σ be the following linear system over ℤ/2ℤ:

Σ=[A=0010,B=1000,C=(11),D=(01)].

We compute the invariant indices ξ₁ and ξ₂

ξ1=rk(B)=rk(1000)=1 and ξ2=rk(BAB)−rk(B)=rk(10000010)−rk(1000)=2−1=1.

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 𝓚^Σ = (κ₁, κ₂) = (2, 0), see Table 1.

Table 1

Kronecker’s indices in ℤ/2ℤ by Young’s diagrams.

Conjugate Kronecker’s Indices	Kronecker’s Indices
	ξ1ξ2
	κ1κ2

Definition 2.4

([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 N_i = B + f(N_i−1), M_i = X / N_i and I_i = N_i / N_i−1 are extended to the invariant modules Z_i = Ker (I_i → I_i+1) which form a complete family of invariant elements.

Moreover, in [32] it is proved that the classes of feedback isomorphisms of locally Brunovsky linear systems with state space X, a projective finitely generated R-module of constant rank δ, is in bijective correspondence with the set of solutions of the following linear equation

X≃Z1⊕(Z2)2⊕…⊕(Zs)s⊕⋯, (3)

in P(R), the monoid of isomorphism classes of finitely generated projective R-modules. Therefore we can compute the number of classes of feedback isomorphisms of locally Brunovsky linear systems with state space X, fe_R(m) (where m denotes the class of isomorphisms of X in P(R)) by

feR(m)=#{Solutions of the equation (3) in the abelian monoid (P(R),⊕)}.

If the monoid is cancellative, the invariant modules IiΣ≅ZiΣ⊕Ii+1Σ classify too, and then,

feR(m)=#{Solutions of the equation I1⊕I2⊕….⊕Is in the abelian monoid (P(R),⊕)}.

Remark 2.5

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 fe_R(m) = fe_R(δ) = [p_ℕ(δ)]^#Spec(R).

In the case of linear systems over commutative rings, we recall that ξi=dim(NiΣ)−dim(Ni−1Σ) and we can obtain another set of invariants ζi=dim(ZiΣ) = ξ_i − ξ_i−1 (see [32]).

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.

Theorem 2.6

(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 𝔽ⁿ[z, z⁻¹] 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 kn - convolutional code 𝓒 of degree δ over a finite field is a free submodule of 𝔽[z]ⁿ of rank k. In the following, we use the notation of McEliece and we say that 𝓒 is an (n, k, δ)- convolutional code (see [37]). With this point of view a convolutional code 𝓒 can be described by an I/S/O representation Σ^𝓒 = (A, B, C, D); i.e. a reachable linear system over the finite field. Moreover, if we consider a reachable and observable linear system Σ over a finite field, then we obtain an observable convolutional code that is usually denoted by 𝓒(A, B, C, D) (see [21, 22]). In the sequel, we denote it by 𝓒(Σ).

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:

An (n, k)- family of convolutional codes over a commutative ring R, 𝕮, is a free submodule 𝕮 ⊂ R[z]ⁿ of rank k, and such that R[z]ⁿ/𝕮 is flat over R. In this case, we can consider families of convolutional codes, one of each prime ideal 𝔭 in Spec(R). The above definition allows us to understand a convolutional code over R as a family of convolutional codes parametrized by Spec(R): that is, 𝕮 over a ring R give rise to a convolutional code over every residue field of R. Moreover, we have that an encoder for an (n, k) - family of convolutional codes 𝕮 over R is a matrix

G(z):R[z]k→R[z]nu(z)↦v(z)=G(z)u(z)

such that Im G(z) = 𝕮 and G(z) is injective.

Definition 2.7

Let R be a commutative ring with identity. G(z) is a systematic encoder if there exists a unimodular matrix T(z) ∈ R(z)^k×k such that

G(z)⋅T(z)=(G′(z)Idk),

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)).

Remark 2.8

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.

Let 𝕮 ⊂ R[z]ⁿ be an (n, k)-family of convolutional codes over R and let 𝔭 ∈ Spec R be a prime ideal. Since R[z]ⁿ/𝕮 is R-flat, the reduction of 𝕮 modulo 𝔭, 𝕮(𝔭) := 𝕮/𝔭𝕮, is an (n, k)-convolutional code over k(𝔭) := R_𝔭/𝔭 R_𝔭. For each 𝔭, we denote by δ(𝔭) the degree of 𝕮(𝔭). Thus, in this setting the degree of the family 𝕮 is no longer an integer but a function

δ:Spec(R)→N. (4)

Definition 2.9

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) = {𝔪₁, …, 𝔪_t}. We denote 𝔽_j : = R / 𝔪_j. Thus we can consider an (n, k, δ) convolutional code, 𝓒_j, over each 𝔽_j.

Remark 2.10

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, G_j(z), are systematic too. The inverse does not hold true, in general.

By [19, 20] there exists a unique triple of matrices (K, L, M) ∈ R^{(δ+n−k)×δ} × R^{(δ+n−k)×δ} × R^{(δ+n−k)×n} defining a first order representation of the code such that

C={v(z)∈R[z]n∣∃x(z)∈R[z]δ such that (zK+L)x(z)+Mv(z)=0} (5)

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.

From the above representation, we also have available an input/state/ouput (I/S/O) representation that describes the code as a reachable linear system: We can make elementary operations over (K, L, M) and obtain (𝓚, 𝓛, 𝓜) such that

K=−IδO,L=AC and M=OB−I(n−k)D, (6)

where Σ^𝕮 ∈ R^δ×δ × R^δ×k × R^(n−k)×δ × R^(n−k)×k, and it verifies that

Ker(zK+L∣M)≃Ker(zK+L∣M).

The matrices A, B, C and D over R define a representation of the code as a controllability state spaces linear system from Equation (5) to

xt+1=Axt+Butyt=Cxt+Dutvt=ytut,x0=0,∃y:xy+1=0, (7)

where x_t ∈ R^δ is the state vector, u_t ∈ R_k is the information vector, y_t ∈ R^p is the parity vector and v_t is a codeword of 𝕮 for each time instant t. We assume that v_t 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].

Notation

If we denote by I_j the ideal generated by all components in which R decomposes except 𝔽_j; that is, I_j = 𝔽₁ × … × 𝔽_j−1 × 𝔽_j+1 × … × 𝔽_t, then we have the following exact sequence for each j = 1, …, t

0→Ij↪ijR→πjFj→0.

Then we denote by φ_rs the canonical isomorphism

φrs:F1r×s×…×Ftr×s→Rr×s(M1,…,Mt)↦φ(M1,…,Mt):=M=(mij),

where

Ml≡M(mod Il) and mijl≡mij(mod Il)

and mijl is the ij-th component of the matrix M_l and l = 1, …, t.

Remark 2.11

Note that the triple of matrices (K, L, M) can be constructed through φ_rs by taking K_j ≡ K (mod I_j), L_j ≡ L (mod I_j) and M_j ≡ M (mod I_j) where (K_j, L_j, M_j) 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.

Remark 2.12

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:

Definition 2.13

(c.f. Lemma 3.3.2, [23]). Let 𝓒 ⊂ 𝔽[z]ⁿ be an (n, k, δ)-convolutional code. It is observable if there exists a syndrome Former ψ : 𝔽[z]ⁿ ↠ 𝔽[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]ⁿ/𝓒 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]ⁿ/ 𝕮 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 (g_i,j(z) where i = 1, …, n}, as δ(G(z)): = ∑l=1k ν_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 κ₁ ≥ … ≥ κ_k. The invariant δ = ∑i=1k κ_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 𝔎^𝓒 = (κ₁, …, κ_k).
Note that the controllability indices of a convolutional code are unique and invariants of the code.

Remark 3.1

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:

Theorem 3.2

(c.f. Theorem 2, [44].). If Σ = (A, B) forms a controllable pair such that A ∈ 𝔽^δ×δ and B ∈ 𝔽^δ×k, then there exist positive integers κ₁ ≥ … ≥ κ_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:

κ₁ = κ, the controllability index of Σ.
∑i=1k κ_i = δ, the size of matrix A.
There exists polynomial matrices X(z), Y(z), U(z) satisfying
Ker(zI−A0−B−CI−D)=ImX(z)Y(z)U(z)

and having the property that the i-th column degree of G(z) = (Y(z)U(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) = Ker(zI−A0−B−CI−D), Theorem 3.2 could be applied and then controllability indices of 𝓒 equal the Kronecker indices of the pair Σ^𝓒 = (A, B)^𝓒. In particular, one has that 𝔎^𝓒 = 𝓚^{Σ^𝓒}.

Example 3.3

Consider the encoder of a (3, 2, 2)-convolutional code 𝓒 over ℤ/2ℤ

G(z)=z+11z2001

whose controllability indices are 𝔎^𝓒 = (κ₁, κ₂) = (2, 0).

We can compute a minimal first order representation of 𝓒; that is, the matrices K, L and M that characterize the encoder G(z):

K=100100,L=001011 and M=010000101.

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 𝓚^{Σ^𝓒} = (κ₁, κ₂)=(2,0).

Let R be a noetherian von Neumann regular ring. Let 𝕮 ≃ ⊕j=1t 𝓒_j be an (n, k, δ) systematic family of convolutional codes over R where 𝓒_j is an (n, k, δ) convolutional code over each R/𝔪_j = 𝔽_j for each maximal ideal 𝔪_j ∈ Spec(R).

Definition 3.4

We define the set of controllability indices of 𝕮, and we denote them by 𝔎^𝕮, as the t-uple of vectors where each component is the set of controllability indices of each 𝓒_j, namely

KC=[(κ11,…,κ1t),…,(κk1,…,κkt)],

where (κij) is the i-th controllability index of the convolutional code 𝓒_j.

Remark 3.5

By definition of 𝕮 every convolutional code 𝓒_j has the same number of controllability indices, k, and ∑i=1kκij=δ, the degree of the code, for all j = 1 … t.

Definition 3.6

We define the set of Kronecker indices of Σ^𝕮, and we denote them by 𝓚^{Σ^𝕮}, as the t-uple of vectors where each component is the set of Kronecker indices of each Σ^𝓒_j, namely

KΣC=[(K11,…,K1t),…,(Kk1,…,Kkt)],

where (Kij) is the i-th Kronecker index of the associated I/S/O representation Σ^𝓒_j of the convolutional code 𝓒_j.

Example 3.7

Let 𝕮 be the following encoder of a family of convolutional codes over ℤ/6ℤ

C=1+z2z+33z2+2z002z+3 where KC=[(2,1),(0,1)] because C⊗Z/2Z=CZ/2Z=1+z1z2001 with KCZ/2Z=[(2,0)] and C⊗Z/3Z=CZ/3Z=1+z2z2z002z with KCZ/3Z=[(1,1)].

Moreover, note that Σ^{𝕮^ℤ/6ℤ} described by

ΣCZ/6Z=[A=0030,B=5002,C=(13),D=(21)]

has Kronecker’s indices 𝓚^{Σ^𝕮} = [(2, 1), (0, 1)] because 𝓚^{Σ^{𝓒^ℤ/2ℤ}} = 𝓚^{Σ^𝓒₁} = [2, 0] (see Example 3.3) and 𝓚^{Σ^{𝓒^ℤ/3ℤ}} = 𝓚^{Σ^𝓒₂} = [1, 1] because

ΣC2=[A2=0000,B2=2002,C2=(10),D2=(21)]

and then ξ₁ = rk(B₂) = 2 and ξ₂ = rk (B₂ A₂B₂) − rk(B₂) = 2 − 2 = 0. So, by Table 2, 𝓚^{Σ^𝓒₂} = [1, 1].

Table 2

Kronecker’s indices over ℤ/3ℤ

Conjugate Kronecker’s Indices	Kronecker’s Indices
	ξ1ξ2
	κ1κ2

Now we define the feedback convolutional relation between families of convolutional codes over a noetherian von Neumann regular ring R.

Definition 3.8

Let 𝕮 and 𝕮 be (n, k, δ) - systematic families of convolutional codes over R. The feedback convolutional relation between families of convolutional codes, ∼f.c.e. , is defined as

C∼f.c.eC¯⇔KC=KC¯.

Note that f.c.e. is an equivalence relation.

Lemma 3.9

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.

Proof

Feedback equivalence classes of a family of convolutional codes 𝕮 such that the components of their controllability indices verify ∑j=1kκij=δ for each i = 1, …, t, are the possible ways to get δ, t times; that is, p_ℕ(δ)^t.□

Remark 3.10

Note that Definition 3.8 and Lemma 3.9 hold for convolutional codes over finite fields. In this case, the number of feedback equivalence classes of convolutional codes with the same degree δ under f.c.e relation is equal to the partitions of the degree of the code; that is,

#{feedback equivalence classes of C}=p(δ),

where p(δ) denotes the partitions of integer δ.

We give our main result.

Theorem 3.11

Let 𝕮 and 𝕮 be systematic families of convolutional codes over R. Let Σ^𝕮 and Σ^𝕮 be the corresponding I/S/O representations. Then

C∼f.c.eC¯⇔ΣC≃f.iΣ¯C¯,

where f.i denotes the feedback isomorphism between locally Brunovsky linear systems with state space of rank δ and Σ^𝕮 = (A, B)^𝕮 (respectively for Σ^𝕮).

Proof

An I/S/O representation of a family of convolutional codes over R is a reachable linear system, thus R is a Locally Brunovsky ring by [36]. Therefore, we can apply the results of feedback classification of locally Brunovsky linear systems described in Subsection 2.1. Since P(R) = ℕ^t is cancellative, the invariants I_i classify too, and thus,

ΣC≃f.iΣ¯C¯⇔[ZiΣC]=[ZiΣ¯C¯]⇔[IiΣC]=[IiΣ¯C¯]. (8)

From P(R) ≃ P(𝔽₁) × … × P(𝔽_t), Equation (8) implies that

[IiΣC⊗RFj]=[IiΣ¯C¯⊗RFj] for j=1,…,t⇒[IiΣCj]=[IiΣ¯C¯j].

Now, Σ^𝓒_j and Σ^𝓒_j are I/S/O representations (reachable dynamical linear systems) over 𝔽_j. The set of finitely generated projective modules of a finite field is the cancellative monoid P(𝔽_j) = ℕ. So,

[IiΣCj]=[IiΣ¯C¯j]⇔ΣCj≃f.e.Σ¯C¯j⇔KΣCj=KΣC¯j.

Then, by [44], 𝔎^𝓒_j = 𝔎^𝓒_j and

[(κ11,…,κ1t),…,(κk1,…,κkt)]=[(κ¯11,…,κ¯1t),…,(κ¯k1,…,κ¯kt)]⇒KC=KC¯⇔C≃f.c.e.C¯.

□

Theorem 3.12

Let R be a noetherian von Neumann regular ring that decomposes in finite fields. Then

{ΣC/∼}={Br(R)/∼},

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 Σ^𝕮).

Proof

Since R is a Locally Brunovsky ring, and by Theorem 3.11,

#{feedback classes of C}=#{[ΣC]}⊆#{[Br(R)]}=feR(δ).

By Lemma 3.9, # { feedback classes of 𝕮 } = p(δ)^t and since R is a noetherian von Neuman regular ring, this number is equal to fe_R(δ), 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.

Example 3.13

Let R be the ring of modular integers ℤ/6ℤ ≃ ℤ/2ℤ × ℤ/3ℤ. Let Σ_i be the following classes of feedback isomorphisms of locally Brunovsky linear systems over ℤ/6ℤ

Σ1=[(0010),(1000)],Σ2=[(0000),(1001)],Σ3=[(0030),(5002)] and Σ4=[(0020),(5003)].

By Theorem 3.12 we can consider the above systems as I/S/O representations over ℤ/6ℤ obtaining the corresponding classes of feedback convolutional equivalence of families of convolutional codes. In order to compute them, we have added random pairs of matrices C and D,

Σ1=[A=0010,B=1000,C=(10),D=(41)].

Then, we obtain the minimal first order representation

K1=500500,L1=001010,M1=010000541

and the family of convolutional codes

C1(Σ1)=1z+4z215z2001 where κC1(Σ1)=[(2,2),(0,0)].

The following system is Σ₂:

Σ2=[A=0000,B=1001,C=(32),D=(12)].

Then, we obtain the following minimal first order representation

K2=500500,L2=000032,M2=010001512

and the family of convolutional codes

C2(Σ2)=3+z2+2zz00z where κC2(Σ2)=[(1,1),(1,1)].

We are going to compute the results for Σ₃

Σ3=[A=0030,B=5002,C=(13),D=(21)].

Then, we obtain the minimal first order representation

K3=500500,L3=003013,M3=050002521

and the family of convolutional codes

C3(Σ3)=1+z2z+33z2+2z002z+3 where KC3(Σ3)=[(2,1),(0,1)].

Finally,

Σ4=[A=0020,B=5003,C=(11),D=(32)].

Then, we obtain its minimal first order representation

K4=500500,L4=002011,M4=050003532

and the following family of convolutional codes

C4(Σ4)=1+5z53z+4z2004+3z where KC4(Σ4)=[(1,2),(1,0)].

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.Search in Google Scholar

[2] Petsche, T., Dickinson B. W., A Trellis - structured Neural Network, Neural Infor. Proc. Systems, 1988, 592 - 601.Search in Google Scholar

[3] Forney Jr. G.D., Concatenated Codes, MIT Press, Cambridge, MA, 1966.Search in Google Scholar

[4] Rosenthal J., Codes, systems and graphical models, IMA, vol. 123, ch. Connections between linear systems and convolutional codes, Springer - Verlag, 2001, 39 - 66,10.1007/978-1-4613-0165-3_2Search in Google Scholar

[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.Search in Google Scholar

[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.10.1016/j.laa.2007.03.017Search in Google Scholar

[7] Rosenthal J., Smarandache R., Maximum distance separable convolutional codes, Appl. Algebr. Eng. Comm., 1999, 10 (1), 15-32.10.1007/s002000050120Search in Google Scholar

[8] Zerz E., On multidimensional convolutional codes and controllability properties of multidimensional systems over finite rings, Asian J. Control, 2010, 12 (2), 119-126.10.1002/asjc.169Search in Google Scholar

[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.1109/TCOMM.2004.831382Search in Google Scholar

[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.10.5120/8518-2553Search in Google Scholar

[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.Search in Google Scholar

[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.Search in Google Scholar

[13] Fagnani, F., Zampieri S., System-theoretic properties of convolutional codes over rings, IEEE T. Infor. Theory, 2001, 47 (6), 2256-2274.10.1109/18.945247Search in Google Scholar

[14] Johannesson R., Wan Z., Wittenmark E., Some structural properties of convolutional codes over rings, IEEE T. Infor. Theory, 1998, 44 (2), 839-845.10.1109/18.661532Search in Google Scholar

[15] Kuijper M., Pinto R., On minimality of convolutional ring encoders, IEEE T. Inform. Theory, 2009, 55 (11), 4890-4897.10.1109/TIT.2009.2030486Search in Google Scholar

[16] El Oued M., Napp D., Pinto R., Toste M., The dual of convolutional codes over Z_p^r. volume entitled Applied and Computational Matrix Analysis. Springer Verlag, 2017, 192, 79–91.10.1007/978-3-319-49984-0_5Search in Google Scholar

[17] El Oued M., Sole P., MDS convolutional codes over a finite ring. IEEE T. Inform. Theory.,2013, 59 (11), 7305 –7313.10.1109/TIT.2013.2277721Search in Google Scholar

[18] Napp D., Pinto R., Toste M., On MDS convolutional codes over Z_p^r, Des. Codes Cryptogr., 2017, 83, 101–114.10.1007/s10623-016-0204-9Search in Google Scholar

[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.Search in Google Scholar

[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.Search in Google Scholar

[21] Rosenthal J., Schumacher, J. M., York E. V., On behaviors and convolutional codes, IEEE T. Inform. Theory, 1996, 42 (6), 1881-1891.10.1109/18.556682Search in Google Scholar

[22] Rosenthal J., York E. V., BCH Convolutional Codes, IEEE T. Inform. Theory, 1999, 45 (6), 1833-1844,10.1109/18.782104Search in Google Scholar

[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.Search in Google Scholar

[24] Brewer J. W., Klingler L., On feedback invariants for linear dynamical systems, Linear Algebra Appl., 2001, 325 (1-3), 209-220.10.1016/S0024-3795(00)00263-9Search in Google Scholar

[25] Brewer J. W., Bunce J. W., Van Vleck F. S., Linear Systems over Commutative Rings, Marcel Dekker, New York, 1986.Search in Google Scholar

[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.10.1016/0022-4049(86)90043-5Search in Google Scholar

[27] MacWilliams F. J., A theorem on the distribution of weights in a systematic code. Bell Syst. Tech. J., 1963, 42, 79–94.10.1002/j.1538-7305.1963.tb04003.xSearch in Google Scholar

[28] Gluesing-Luerssen H., Schneider G., State space realizations and monomial equivalence for convolutional codes, Linear Algebra Appl., 2007, 425 (2-3), 518-533.10.1016/j.laa.2007.03.004Search in Google Scholar

[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.10.1016/j.ffa.2004.01.001Search in Google Scholar

[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.10.1016/S0024-3795(98)00020-2Search in Google Scholar

[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.10.1016/0024-3795(94)00062-XSearch in Google Scholar

[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.10.1016/j.laa.2012.08.040Search in Google Scholar

[33] Hautus M.L.J., Controllability and observability condition for linear autonomous system. Ned. Akad. Wetenschappen, Proc. Ser. A, 1969, 72, 443-448.10.1016/S1385-7258(70)80049-XSearch in Google Scholar

[34] Brunovsky P. A., A classification of linear controllable systems, Kibernetika, 1970, 6 (3), 173-187.Search in Google Scholar

[35] Kalman R. E., Kronecker invariants and Feedback, in Ordinary Differential Equations, Academic Press (New York), 1972, 459-471.10.1016/B978-0-12-743650-0.50043-5Search in Google Scholar

[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.10.1016/j.laa.2016.01.019Search in Google Scholar

[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.Search in Google Scholar

[38] Massey J.L., Sain M.K., Codes, automata and continuous systems: explicit interconnections, IEEE Trans. Automat. Contr., 1967, 12 (6), 644–650.10.1109/SAP.1967.272972Search in Google Scholar

[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.10.1007/978-1-4613-0165-3_19Search in Google Scholar

[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.10.1016/0005-1098(87)90120-8Search in Google Scholar

[41] Kuijper M., First Order Representations of Linear Systems, Ph.D. Thesis, Boston, MA: Birkhäuser, 199410.1007/978-1-4612-0259-2Search in Google Scholar

[42] Kuijper M., Schumacher J. M., Realization of Autoregressive Equations in Pencil and Descriptor Form, SIAM J. Control Optim., 1990, 28 (5), 1162-1189.10.1137/0328063Search in Google Scholar

[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.10.1137/S0363012995292044Search in Google Scholar

[44] Popov V. M., Invariant description of linear time-invariant controllable systems, SIAM J. Control Opl, 1972, 10 (2), 252-264.10.1137/0310020Search in Google Scholar

Received: 2016-11-14

Accepted: 2017-10-20

Published Online: 2017-12-29

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.