Home Monomial codes seen as invariant subspaces
Article Open Access

Monomial codes seen as invariant subspaces

  • MarĂ­a Isabel GarcĂ­a-Planas , Maria Dolors Magret and Laurence Emilie Um
Published/Copyright: August 23, 2017

Abstract

It is well known that cyclic codes are very useful because of their applications, since they are not computationally expensive and encoding can be easily implemented. The relationship between cyclic codes and invariant subspaces is also well known. In this paper a generalization of this relationship is presented between monomial codes over a finite field 𝔽 and hyperinvariant subspaces of 𝔽n under an appropriate linear transformation. Using techniques of Linear Algebra it is possible to deduce certain properties for this particular type of codes, generalizing known results on cyclic codes.

MSC 2010: 94B15; 15B33

1 Introduction

It is well known that error correcting codes and cryptographic systems have conflicting objectives, since the first are codes protecting the information of occasional errors due to handling, that is, those searching to solve the difficulties posed by unreliability of the channel, but cryptosystems, also called secret codes, try to ensure its confidentiality, integrity and security. However, they also have complementary objectives. The difficulty for decoding error correcting codes has been used to build cryptographic systems from these codes. Among these systems there is the well known public key McEliece system. In this system the private key of each user is the generator matrix G of a linear code C over a finite field 𝔽q joint with a decoding algorithm. The matrix G is hidden by a permutation matrix thus obtaining the public key, ([1], [2], [3]).

Alongside the use of cryptography to protect communications, there is the technique known as “steganography”whose use is increasing and which consists in the concealment of information. It is used in order to protect information in an anodyne numerical support and it is the support that is sent over a public transmission channel. These techniques of concealment of information are based on cyclic codes over the ring ℤ4, ([4], [5]). Possibly they can improve the efficiency in dissimulation using a generalization of cyclic codes such as the monomial codes.

A first generalization of cyclic codes were constacyclic codes, introduced by E. R. Berlekamp in [6]. Monomial codes are a broader generalization. Linear algebra as a tool to study such codes was introduced in [7]. Monomial codes are widely used because they can be encoded with shift registers.

Let p be a prime number, q = pk for some k ≥ 1. A monomial q-ary code of length n can be defined through a n × n generator-matrix with the property that each row (except the last one) (c1, c2,..., cn), ci ∈ GF(q) defines the row as (ancn, a1c1, a2c2,..., an-1cn-1), where a1,..., an are certain fixed elements of GF(q)\{0}. Cyclic codes (a1 =... = an = 1) and constacyclic codes (a1 =... = an-1 = 1) are special subclasses of monomial codes of GF(q)n. Monomial codes can also be described in terms of linear algebra, which constitutes our starting point that will be the characteristic polynomial of the endomorphism of GF(q)n whose matrix in the canonical basis is the one representing the monomial code.

Recall that, given an endomorphism ϕ of a 𝔽-vector space E, a ϕ-invariant subspace V ⊂ E is hyperinvariant when it is invariant under all linear transformations commuting with ϕ.

2 Invariant subspaces of monomial matrices

Let p be a prime number, q = pk for some k ≥ 1 and 𝔽 = GF(q) and 𝔽n thee n-dimensional 𝔽-vector space.

Let ā = (a1,... an) be a set of n parameters of 𝔽 and consider the following linear map

φ a ¯ : F n → F n ( x 1 , . . . , x n ) → ( a n x n , a 1 x 1 , . . . , a n − 1 x n − 1 ) (1)

whose associated matrix with respect to the canonical basis {e1 = (1, 0,..., 0), e2 = (0, 1,..., 0), en = (0, 0,..., 1)} is:

A a ¯ =( 0 0 ⋯ 0 a n a 1 0 ⋯ 0 0 0 a 2 ⋯ 0 0 ⋮ ⋮ ⋱ ⋮ ⋮ 0 0 ⋯ a n−1 0 ). (2)

This matrix is called a monomial matrix. We note that this matrix can be written as the product of a diagonal matrix diag (an, a1,..., an-1) and the permutation matrix

( 0 0 ⋯ 0 1 1 0 ⋯ 0 0 0 1 ⋯ 0 0 ⋮ ⋮ ⋱ ⋮ ⋮ 0 0 ⋯ 1 0 ).

Properties

This matrix verifies:

  1. A a ÂŻ n = a 1 . . . a n I n

  2. i f ∏ i = 1 n a i ≠ 0 t h e n A a ¯ − 1 = 1 ∏ i = 1 n a i A a ¯ n − 1 = A a ¯ ¯ t , w h e r e a ¯ ¯ = ( 1 a 1 , . . . , 1 a n ) .

  3. its characteristic polynomial is p a ( s ) = det ( A a ¯ − s I n ) = ( − 1 ) n ( s n − ∏ i = 1 n a i ) .

Proposition 2.1

Suppose that a = ∏ i = 1 n a i ≠ 0. Then, the matrix (2) is equivalent under similarity to

A a =( 0 0 ⋯ 0 a 1 0 ⋯ 0 0 0 1 ⋯ 0 0 ⋮ ⋮ ⋱ ⋮ ⋮ 0 0 ⋯ 1 0 )

Proof

It is easy to prove that

A a ÂŻ S = S A a .

with

=( 0 0 ⋯ 0 ∏ i=1 n a i a 1 0 ⋯ 0 0 0 a 1 a 2 ⋯ 0 0 ⋮ ⋮ ⋱ ⋮ ⋮ 0 0 ⋯ ∏ i=1 n−1 a i 0 )

☐

In this section we prove that a ϕā-invariant subspaces are also ϕā-hyperinvariants; that is to say, invariant under all linear maps commuting with ϕā, (see [8] and [9] for more information about these subspaces).

We need to know the centralizer of Aā. To do that, we first calculate the centralizer of the matrix Aa.

Proposition 2.2

([7). ] The centralizer 𝒞(Aa) is the set of the matrices Xa in the form:

X a =( x n a x 1 a x 2 a x 3 ⋯ a x n−2 a x n−1 x n−1 x n a x 1 ab x 2 ⋯ a x n−3 a x n−2 ⋮ ⋱ ⋱ ⋮ ⋱ ⋱ x 3 x 4 x 5 x 6 ⋯ a x 1 a x 2 x 2 x 3 x 4 x 5 ⋯ x n a x 1 x 1 x 2 x 3 x 4 ⋯ x n−1 x n )

Proposition 2.3

The centralizer 𝒞(Aā) of Aā is the set of the matrices Yā = SXaS-1, if AāS = SAa.

Proof

Proposition 2.2, we have XaAa = AaXa. Then, SXaS-1Aā = AāSXaS-1. ☐

Note that if v = (v1,..., vn) is an eigenvector of Aā, then:

a n v n = λ v 1 a 1 v 1 = λ v 2 a 2 v 2 = λ v 3 ⋮ a n − 2 v n − 2 = λ v n − 1 a n − 1 v n − 1 = λ v n (3)

In particular, we have that

v = ( λ n − 1 a 1 . . . a n − 1 , λ n − 2 a 2 . . . a n − 1 , . . . , λ a n − 1 , 1 ) (4)

and the following Proposition holds.

Proposition 2.4

Let λ ∈ GF(q)* be an element such that λ n = ∏ i = 1 n a i . Then, the one-dimensional subspace [v] spanned by the vector v given in (4) is an hyperinvariant subspace.

Proof

A a ÂŻ v = Îť v

and given any Yā ∈ 𝒞(Aā), then

Y a ¯ v = S ( x n I + x n − 1 A a ¯ + x n − 2 A a ¯ 2 + . . . + x 1 A a ¯ n − 1 ) S − 1 v = x n v + x n − 1 S A a S − 1 v + x n − 2 S A a 2 S − 1 v + . . . + + x 2 S A a n − 2 S − 1 v + x 1 S A a ¯ n − 1 S − 1 v = x n v + x n − 1 λ v + x n − 2 λ 2 v + . . . + x 1 λ n − 1 v = α v

with α = xn + xn-1λ + x2λ2 + ... + x2λn-2 + x1λn-1 ∈ 𝔽. ☐

Proposition 2.5

Let F be an invariant subspace of Aā. Then, F is hyperinvariant.

Proof

It suffices to observe that, for all Yā ∈ 𝒞(Aā),

S X a S − 1 = x n I + x n − 1 A a ¯ + x n − 2 A a ¯ 2 + . . . + x 1 A a ¯ n − 1 .

☐

Therefore, in this case the lattice of invariant subspaces coincides with the lattice of hyperinvariant subspaces:

H i n v ( A a ÂŻ ) = I n v ( A a ÂŻ ) .

Definition 2.6

  1. Let u = (u1,..., un) and v = (v1,..., vn) be two vectors in 𝔽n. We define an inner product over 𝔽 as follows:

    < u , v >= u 1 v 1 + . . . + u n v n .
  2. Two vectors u, v in 𝔽n are said to be orthogonal if < u, v >= 0.

  3. Let F be a subspace of 𝔽n. The dual subspace of F (denoted by F⊥) is

    F ⊥ = { v ∈ F n | ∀ u ∈ F , < u , v >= 0 } .

Proposition 2.7

Let F be an invariant subspace of Aā. Then F┴ is an invariant subspace of A a ¯ ¯ − 1 .

Proof

Let v ∈ F⊥. For all u ∈ F (consequently, Aāu ∈ F) we have

0 =< A a ¯ u , v >=< u , A a ¯ t v >=< u , ∏ i = 1 n a i A a ¯ ¯ n − 1 v > =< u , A a ¯ ¯ − 1 v >

Thus A a ¯ ¯ − 1 v ∈ F ⊥ . ☐

Let 𝔽[λ1,..., λn] be the algebraic extension of 𝔽 = GF(q) and let λ1,..., λn be the eigenvalues of ϕā with λ i = ∏ i = 1 n n λ i , i = 1,..., n, where λ is a primitive nth root of unity and ∏ i = 1 n a i n is a fixed, but otherwise arbitrary zero of the polynomial s n − ∏ i = 1 n a i , w h e r e 0 ≠ ∏ i = 1 n a i ∈ F .

Let vi, i = 1,..., n be the respective eigenvectors. More particularly we have

A a ¯ v i = λ i v i , v i = ( λ i n − 1 a 1 . . . a n − 1 , λ i n − 2 a 2 . . . a n − 1 , . . . , λ i a n − 1 , 1 ) ,

i = 1,..., n,

where Aā is the matrix associated to

φ a ¯ : F [ λ 1 , . . . , λ n ] n → F [ λ 1 , . . . , λ n ] n

(defined as in 2).

Let us consider the basis v = (v1,..., vn) of eigenvectors of ϕā. Applying basis change to Aā, we obtain the following diagonal matrix

D a ¯ =( λ 1 0 ⋯ 0 0 λ 2 ⋯ 0 ⋮ ⋮ ⋱ ⋮ 0 0 ⋯ λ n )= S −1 AS

and taking into account (4) we have

S=( λ 1 n−1 a 1 ...  a n−1 λ 2 n−1 a 1 ...  a n−1 ⋯ λ n n−1 a 1 ...  a n−1 λ 1 n−2 a 2 ...  a n−1 λ 2 n−2 a 2 ...  a n−1 ⋯ λ n n−2 a 2 ...  a n−1 ⋮ ⋮ ⋮ λ 1 a n−1 λ 2 a n−1 ⋯ λ n a n−1 1 1 ⋯ 1 )

We define now the following vectors:

u i = ( λ i a 1 . . . a n − 1 , λ i 2 a 2 . . . a n − 1 , . . . , λ n − 1 a n − 1 , λ i n ) , 1 ≤ i ≤ n (5)

Proposition 2.8

The set of vectors defined in (5) verify the following relationship.

< u i , v j >= { a 1 . . . a n n i f i = j 0 i f i ≠ j

Proof

< u i , v j >= ∑ ℓ = 1 n λ i ℓ λ j n − ℓ = ∑ ℓ = 1 n λ i ℓ λ j n − ℓ λ j ℓ λ j ℓ = ∑ ℓ = 1 n ( λ i λ j ) ℓ λ j n = a 1 . . . a n ∑ ℓ = 1 n ( λ i λ j ) ℓ = { a 1 . . . a n ∑ ℓ = 1 n 1 ℓ = a 1 . . . a n n i f i = j a 1 . . . a n ∑ ℓ = 1 n ( λ ) ℓ = 0 ( w i t h λ a r o o t o f u n i t ) i f i ≠ j

☐

From this Proposition the inverse matrix of the matrix S can easily obtained.

3 Monomial codes as invariant subspaces

Definition 3.1

A code C of length n over the field 𝔽 is called monomial with respect to a1, ..., an, if whenever c = (c1,..., cn) belongs to C, then sc = (ancn, a1c1,..., an-1cn-1) is also in C.

The shift (the map c → sc) can be represented in a matrix form

( 0 0 ⋯ 0 a n a 1 0 ⋯ 0 0 0 a 2 ⋯ 0 0 ⋮ ⋮ ⋱ ⋮ ⋮ 0 0 ⋯ a n−1 0 )( c 1 c 2 c 3 ⋮ c n )=( a n c n a 1 c 1 a 2 c 2 ⋮ a n−1 c n )

Note that this matrix is the matrix (2).

In the particular case where ai = 1, for all i, the code is a cyclic code and if a1 = ... = an-1 = 1 is a constacyclic code (see [10]).

Applying Proposition 2.1 the study can be reduced to the case of constacyclic codes. Nevertheless, we will not make use of this result, but directly consider monomial codes.

We are interested in the case where an ≠ ai, for some i = 2,..., an-1 and ∏ i = 1 n a i ≠ 0. In particular, we need to consider q > 2. As an immediate consequence of Definition 3.1 we have the following Proposition.

Proposition 3.2

A linear code C with length n over the field 𝔽 is monomial if, and only if, C is an Aā-invariant subspace of 𝔽n.

And after Proposition 2.5 we have the following result.

Proposition 3.3

A linear code C with length n over the field 𝔽 is monomial if, and only if, C is an Aā-hyperinvariant subspace of 𝔽n.

Suppose now that (n, q) = 1 and p a ¯ ( t ) = ( − 1 ) n ( t n − ∏ i = 1 n a i ) has no multiple roots and splits into distinct irreducible factors.

General Linear Algebra theory over finite fields yields the following statement.

Proposition 3.4

Let C be a monomial code, and

p a ¯ ( s ) = ( − 1 ) n p a ¯ 1 ( s ) ⋅ . . . ⋅ p a ¯ r ( s )

the decomposition of pā(s) into irreducible factors. Then C = Ker pāi1 (Aā) ⊕ ... ⊕ Ker pāis (Aā) = Ker h(Aā), h(s) = pāi1 (s) : . : pāit (s) for some minimal Aā-invariant subspaces Ker pāij (Aā) de 𝔽n.

Example 3.5

Consider the matrix Aā with an = 2, a1 = 4, a2 = ... = an-1 = 1, n = 8 and q = 5. Then p(s) = pā(s) = s8 - 1. Factorizing p(s) into irreducible factors over 𝔽 = GF(5) we have pā(s) = p1(s)p2(s)p3(s)p4(s)p5(s)p6(s) = (s + 1)(s + 2)(s + 3)(s + 4 )(s2 + 2 )(s2 + 3). The factors pi(s) define minimal Aā-invariant subspaces, Fi = Ker pi(Aā), for i = 1, 2, 3, 4, 5, 6.

Let us consider

C= F 1 ⊕ F 5 =Ker( p 1 ( A a ¯ ))⊕Ker( p 5 ( A a ¯ )) Ker( A a ¯ 3 + A a ¯ 2 +2 A a ¯ +2I)= Ker( 2 0 0 0 0 1 3 3 2 2 0 0 0 0 3 4 2 4 2 0 0 0 0 3 4 4 4 2 0 0 0 0 0 3 4 4 2 0 0 0 0 0 3 4 4 2 0 0 0 0 0 3 4 4 2 0 0 0 0 0 3 4 4 2 )

This is a monomial code, C = Kerh(Aā) with h(s) = p1(s)p5(s) = s3 + s2 + 2s + 2.

Example 3.6

With the notations as in the Example above,

g ( s ) = P a ÂŻ ( s ) h ( s ) = p 2 ( s ) p 3 ( s ) p 4 ( s ) p 6 ( s ) = s 5 + 9 s 4 + 29 s 3 + 53 s 2 + 78 s + 72

It is straightforward to check that

( A a ÂŻ 5 + 9 A a ÂŻ 4 + 29 A a ÂŻ 3 + 53 A a ÂŻ 2 + 78 A a ÂŻ + 72 I ) ( v 1 ) = 0 ( A a ÂŻ 5 + 9 A a ÂŻ 4 + 29 A a ÂŻ 3 + 53 A a ÂŻ 2 + 78 A a ÂŻ + 72 I ) ( v 2 ) = 0 ( A a ÂŻ 5 + 9 A a ÂŻ 4 + 29 A a ÂŻ 3 + 53 A a ÂŻ 2 + 78 A a ÂŻ + 72 I ) ( v 3 ) = 0

with

v 1 = ( 1 , 4 , 2 , 1 , 3 , 4 , 2 , 1 ) , v 2 = ( 1 , 0 , 4 , 0 , 2 , 0 , 1 , 0 ) , v 3 = ( 0 , 3 , 0 , 4 , 0 , 2 , 0 , 1 ) .

Corollary 3.7

Let C be a monomial code. There exists g(s) verifying pā(s) = g(s) · h(s) with gcd(g(s), h(s)) = 1 such that g(Aā)c = 0, ∀c ∈ C.

Considering the inner product introduced in definition 2.6.

Proposition 3.8

Let C be a monomial code with respect a1, ..., an. Then, its dual code C┴ is a monomial code with respect 1 a 1 , . . . , 1 a n .

Proof

The statement follows from Proposition 2.7. ☐

In the case a1 = ... = an = 1 we obtain the well known result about cyclic codes.

Corollary 3.9

The dual of a cyclic code is a cyclic code.

4 Parity matrices of monomial codes

Let 𝔽[λ1,..., λn] be the algebraic extension considered in Section 2.

Let C be a monomial code and g(s) as in corollary 3.7. Let us consider a basis v = (v1,..., vn) of eigenvectors of ϕā.

In this basis, the matrix of ϕā is a diagonal matrix, which will be denoted by Dā.

Since Dā is a diagonal matrix, the matrix g(Dā) is also diagonal and

g ( A a ¯ ) = g ( S D a ¯ S − 1 ) = S g ( D a ¯ ) S − 1

Condition g(Aā)c = 0 is equivalent to g(Dā)c′ = 0 where c′ = S-1c.

Without loss of generality we can assume that λ1,..., λn are ordered in such a way that g(λi) = 0, for all 1 ≤ i ≤ k and g(λi) = αi ≠ 0, for all k + 1 ≤ i ≤ n. With h(s) as in corollary 3.7, h(λi) ≠ 0, for all 1 ≤ i ≤ k and h(λi) = 0, for all k + 1 ≤ i ≤ n. Given c = (c1,..., cn) ∈ C and c ′ = ( c 1 ′ , . . . , c n ′ ) = s − 1 c w e h a v e t h a t g ( D a ¯ ) = ( 0 , . . . , 0 , α k + 1 c k + 1 ′ , . . . , α n c n ′ ) . Equivalently:

1 a 1 ...  a n n ( 0 ⋱ 0 α k+1 ⋱ α n )( λ 1 a 1 ⋯ a n−1 λ 1 2 a 2 ⋯ a n−1 ⋯ λ 1 n−1 a n−1 λ 1 n λ 2 a 1 ⋯ a n−1 λ 2 2 a 2 ⋯ a n−1 ⋯ λ 2 n−1 a n−1 λ 2 n ⋮ ⋮ ⋮ ⋮ λ n a 1 ⋯ a n−1 λ n 2 a 2 ⋯ a n−1 ⋯ λ n n−1 a n−1 λ n n )( c 1 c 2 ⋮ c n ) = 1 a 1 ...  a n−1 n ( 0 ⋱ 0 α k+1 λ k+1 a 1 ... a n−1 ⋯ α k+1 λ k+1 n ⋮ ⋮ α n λ n a 1 ... a n−1 ⋯ α n λ n n )( c 1 c 2 ⋮ c n )=0

Then we can deduce the following proposition.

Proposition 4.1

Let uij, 1 ≤ j ≤ r = n − k be a family of vectors as in (5) corresponding to λij, with g(λij) = αij ≠ 0. Then c is a codeword of the monomial code C if and only if

u i j c = 0 , f o r a l l 1 ≤ j ≤ r .

As a consequence the matrix A = (uij) ∈ M(n-k)×n(𝔽[λ1,..., λn]) is a parity matrix of the monomial code over the field 𝔽[λ1,..., λn].

Example 4.2

Over 𝔽 = GF(5) we consider a monomial code C with an = a1 = 2, a2 = ... = a-1 = 1 and n = 4 defined by g(s) = s2 − 2. Over F [ 2 , 4 2 , 3 , 4 3 ] , t h e p o l y n o m i a l h ( s ) = s 2 + 2 = ( s − 3 ) ( s − 4 ⋅ 3 ) .

Then

( 3 ⋅2 3 3 ⋅  3  4 3 ⋅  3  3 2 ⋅  3  4 )

is a parity matrix of the code C over F [ 2 , 4 2 , 3 , 4 3 ] .

5 Hamming distance of monomial codes

Remember that the Hamming weight (for short, weight) of a vector v is the number of its nonzero entries and is denoted wH(v). We have wH(x) = dH(x, 0). The minimum weight of a code C is the minimum nonzero weight among all codewords of C,

w min ( C ) = min 0 ≠ x ∈ C ( w H ( x ) )

Taking into account that dH(x, y) = dH(x−z, y−z) for all z and that in particular dH(x, y) = dH(x−y, y−y) = dH(x−y, 0) we have that over a field, the Hamming distance is translation invariant and, in particular, for linear codes, the minimum weight is equal to the minimum distance.

We are going to obtain a bound for the minimum distance of two parametric monomial codes in a similar way to that presented by Roos in [11] for cyclic codes.

Let 𝔽 be a finite field and

A=( a 1  ...  a n )=( a 11 ⋯ a n1 ⋮ ⋮ a 1ℓ ⋯ a nℓ ).

Let C be a linear code over 𝔽 having A as a parity matrix and dH(A) the minimum distance of C.

Remember that dH(A) = d if and only if every set of d − 1 columns is linearly independent and some set of d columns of A is linearly dependent.

For any matrix X=( x 11 ⋯ x 1n ⋮ ⋮ x m1 ⋯ x mn ) with nonzero columns xi ∈ 𝔽m for 1 ≤ i ≤ n we consider

A ( X ) = ( x 1 ⊗ a 1 ⋯ x n ⊗ a n )

The following result is well known due to Roos ([12]).

Lemma 5.1

If dH(A) ≥ 2 and every m × (m + dH(A) − 2) submatrix of X has full rank, then dH(A(X)) ≥ dH(A) + m − 1.

Definition 5.2

Let M = [λi1,..., λil] be a set of ℓ roots of S n − ∏ i = 1 n a i in 𝔽[λ1,..., λn]. We will say that M is a consecutive set of length ℓ, if there exists a primitive n-root of the unit λ and an exponent i such that M = [ ∏ i = 1 n a i n λ i , . . . , ∏ i = 1 n a i n λ i + ℓ − 1 ] .

Definition 5.3

  1. Let Λ = [λj1,..., λjℓ] be a set of zeros of the polynomial s n − ∏ i = 1 n a i . We define the matrix

    A Λ =( λ j 1 a 1 ⋯ a n−1 λ j 1 2 a 2 ⋯ a n−1 ⋯ λ j 1 n ⋮ ⋮ ⋮ λ j ℓ a 1 ⋯ a n−1 λ j ℓ 2 a 2 ⋯ a n−1 ⋯ λ jℓ n )∈ M ℓ×n (F[ λ 1 ,...,  λ n ]).
  2. Let U = [x1,..., xm] be a set of consecutive zeros of the polynomial sn − 1. We define the matrix

    X U =( x 1 x 1 2 ⋯ x 1 n ⋮ ⋮ ⋮ x m x m 2 ⋯ x m n )∈ M m×n (F[ λ 1 ,...,  λ n ]).

Let C be the monomial code defined by the polynomial pā(s) = g(s) · h(s) over the splitting field 𝔽[λ1,..., λn] of pā(s) and consider now as Λ the set of all zeros of h(s). Following 4.1 the matrix AΛ is a parity matrix of the code C, if the minimum distance of C over 𝔽[λ1,..., λn] is dH(AΛ). Then, the minimum distance of C over 𝔽 is at least dH(AΛ), since C over 𝔽 is a subfield subcode of C over 𝔽[λ1,..., λn].

Remark 5.4

Notice that the minors of AΛ a are of Vandermonde type.

Theorem 5.5

Let Λ be the set defined in 5.3 and U be a consecutive set of roots of sn − 1 such that dH(AΛ)−2 ≥ 0. Then, dH(AΛ(XU)) ≥ dH(Aλ) + card U − 1.

Proof

It suffices to observe that in this particular setup dH(AΛ) ≥ 2, then we can apply Lemma 5.1. ☐

As a Corollary we obtain the following result.

Theorem 5.6

Let C be a monomial code of length n over 𝔽, and pā = g(s)h(s). For some integers ℓ, m ≥ 1, suppose that h(s) has a string of m consecutive zeros: h(λℓ) = h(λℓ+1) = ... = h(λℓ+m-1) = 0. Then, the minimum distance of C is at least d.

Example 5.7

Let n = 9, q = 7, an = 2, a1 = 3, a2 = ... = an-1 = 1 and let α be a 18th-primitive root of unity. Taking into account that (x18 − 1) = (x9 − 1)(x9 + 1), α is a root of x9 + 1 and α2 = β is a primitive root of x9 − 1. We want to classify the zeros with respect to the various irreducible polynomial divisors of x9 + 1. We will determine the cyclotomic cosets of 7 modulo 18 containing the odd integers: C1 = [ 1, 7, 13], C3 = [3], C5 = [5, 17, 11], C9 = [9], C15 = [15].

Let the zeros of h(s) be αi with i ∈ C1 ∪ C5, so h(s) = (s − α)(s − α7)(s − α13)(s − α5)(s − α17)(s − α11). Given that βi = αβi = α2i+1 the zeros of h(s) can be written as β2, β3; β5,β6; β8, β9. Since h(s) has a string of two consecutive zeros. Then, the two parametric monomial code has a minimum distance d ≥ 3.

References

[1] McEliece R.J., A public key cryptosystem based on algebraic coding theory. DNS Progress Report, Jet Propulsion Laboratory-California Inst. Of Tech, 1978, 42-44.Search in Google Scholar

[2] Martinez Moro E., Munuera Gómez C., Un Sistema criptogråfico de clave pública a partir de códigos correctores en Avances en criptología y seguridad de la información, Directores B. Ramos Álvarez, A. Ribagorda Garnacho, 2004, 125-130.Search in Google Scholar

[3] Celikel Cankaya E., Nair S., Cankaya H.C., Applying error correction codes to achieve security and dependability, Computer Standards & Interfaces, 2013, 35, 78-86.10.1016/j.csi.2012.06.009Search in Google Scholar

[4] Jouhari H., Souidi El M., A New Steganographic Scheme based on First Order Reed Muller Codes, in Proceedings of the International Conference on Security and Cryptography, Sevilla, Spain, 2011, 351-356.Search in Google Scholar

[5] Jouhari H., Souidi El M., Application of Cyclic Codes over ℤ4 in Steganography, Journal of Applied Mathematical Sciences, 2012, 6 (139).Search in Google Scholar

[6] Berlekamp E.R., “Algebraic Coding Theory”, Mc Graw-Hill, NewYork, 1968.Search in Google Scholar

[7] Garcia-Planas M.I., Magret M.D., Montoro M.E., Cyclic Codes as Hyperinvariant Subspaces, Proceedings of 6th International Conference on Physics and Control (PhysCon 2013), 2013.Search in Google Scholar

[8] Astuti P, Wimmer H.K., Characteristic and hyperinvariant subspaces over the field GF(2), Linear Algebra and its Applications, 2013, 438 (4), 1551-1563.10.1016/j.laa.2011.03.047Search in Google Scholar

[9] Fillmore P.A., Herrero D.A., Longsta W.E., The hyperinvariant subspace lattice of a linear transformation, Linear Algebra and its Applications, 1977, 17(2), 125-132.10.1016/0024-3795(77)90032-5Search in Google Scholar

[10] Radkova D., Van Zanten A.J., Constacyclic codes as invariant subspaces, Linear Algebra and its Applications, 2009, 430, 855-864.10.1016/j.laa.2008.09.036Search in Google Scholar

[11] Roos C., “A New Lower Bound for the Minimum Distance of a Cyclic Code”, IEEE Transactions on Information Theory, 1983, II-29 (3), 330-332.10.1109/TIT.1983.1056672Search in Google Scholar

[12] Roos C., “A generalization of the BCH bound for cyclic codes, including the Hartmann Tzeng bound, J. Comb. Theory Ser, 1982, 33, 229-232.10.1016/0097-3165(82)90014-0Search in Google Scholar

Received: 2016-5-2
Accepted: 2017-5-17
Published Online: 2017-8-23

Š 2017 García-Planas et al.

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

Articles in the same Issue

  1. Regular Articles
  2. Integrals of Frullani type and the method of brackets
  3. Regular Articles
  4. Edge of chaos in reaction diffusion CNN model
  5. Regular Articles
  6. Calculus using proximities: a mathematical approach in which students can actually prove theorems
  7. Regular Articles
  8. An investigation on hyper S-posets over ordered semihypergroups
  9. Regular Articles
  10. The Leibniz algebras whose subalgebras are ideals
  11. Regular Articles
  12. Fixed point and multidimensional fixed point theorems with applications to nonlinear matrix equations in terms of weak altering distance functions
  13. Regular Articles
  14. Matrix rank and inertia formulas in the analysis of general linear models
  15. Regular Articles
  16. The hybrid power mean of quartic Gauss sums and Kloosterman sums
  17. Regular Articles
  18. Tauberian theorems for statistically (C,1,1) summable double sequences of fuzzy numbers
  19. Regular Articles
  20. Some properties of graded comultiplication modules
  21. Regular Articles
  22. The characterizations of upper approximation operators based on special coverings
  23. Regular Articles
  24. Bi-integrable and tri-integrable couplings of a soliton hierarchy associated with SO(4)
  25. Regular Articles
  26. Dynamics for a discrete competition and cooperation model of two enterprises with multiple delays and feedback controls
  27. Regular Articles
  28. A new view of relationship between atomic posets and complete (algebraic) lattices
  29. Regular Articles
  30. A class of extensions of Restricted (s, t)-Wythoff’s game
  31. Regular Articles
  32. New bounds for the minimum eigenvalue of 𝓜-tensors
  33. Regular Articles
  34. Shintani and Shimura lifts of cusp forms on certain arithmetic groups and their applications
  35. Regular Articles
  36. Empirical likelihood for quantile regression models with response data missing at random
  37. Regular Articles
  38. Convex combination of analytic functions
  39. Regular Articles
  40. On the Yang-Baxter-like matrix equation for rank-two matrices
  41. Regular Articles
  42. Uniform topology on EQ-algebras
  43. Regular Articles
  44. Integrations on rings
  45. Regular Articles
  46. The quasilinear parabolic kirchhoff equation
  47. Regular Articles
  48. Avoiding rainbow 2-connected subgraphs
  49. Regular Articles
  50. On non-Hopfian groups of fractions
  51. Regular Articles
  52. Singularly perturbed hyperbolic problems on metric graphs: asymptotics of solutions
  53. Regular Articles
  54. Rings in which elements are the sum of a nilpotent and a root of a fixed polynomial that commute
  55. Regular Articles
  56. Superstability of functional equations related to spherical functions
  57. Regular Articles
  58. Evaluation of the convolution sum involving the sum of divisors function for 22, 44 and 52
  59. Regular Articles
  60. Weighted minimal translation surfaces in the Galilean space with density
  61. Regular Articles
  62. Complete convergence for weighted sums of pairwise independent random variables
  63. Regular Articles
  64. Binomials transformation formulae for scaled Fibonacci numbers
  65. Regular Articles
  66. Growth functions for some uniformly amenable groups
  67. Regular Articles
  68. Hopf bifurcations in a three-species food chain system with multiple delays
  69. Regular Articles
  70. Oscillation and nonoscillation of half-linear Euler type differential equations with different periodic coefficients
  71. Regular Articles
  72. Osculating curves in 4-dimensional semi-Euclidean space with index 2
  73. Regular Articles
  74. Some new facts about group 𝒢 generated by the family of convergent permutations
  75. Regular Articles
  76. lnfinitely many solutions for fractional SchrĂśdinger equations with perturbation via variational methods
  77. Regular Articles
  78. Supersolvable orders and inductively free arrangements
  79. Regular Articles
  80. Asymptotically almost automorphic solutions of differential equations with piecewise constant argument
  81. Regular Articles
  82. Finite groups whose all second maximal subgroups are cyclic
  83. Regular Articles
  84. Semilinear systems with a multi-valued nonlinear term
  85. Regular Articles
  86. Positive solutions for Hadamard differential systems with fractional integral conditions on an unbounded domain
  87. Regular Articles
  88. Calibration and simulation of Heston model
  89. Regular Articles
  90. One kind sixth power mean of the three-term exponential sums
  91. Regular Articles
  92. Cyclic pairs and common best proximity points in uniformly convex Banach spaces
  93. Regular Articles
  94. The uniqueness of meromorphic functions in k-punctured complex plane
  95. Regular Articles
  96. Normalizers of intermediate congruence subgroups of the Hecke subgroups
  97. Regular Articles
  98. The hyperbolicity constant of infinite circulant graphs
  99. Regular Articles
  100. Scott convergence and fuzzy Scott topology on L-posets
  101. Regular Articles
  102. One sided strong laws for random variables with infinite mean
  103. Regular Articles
  104. The join of split graphs whose completely regular endomorphisms form a monoid
  105. Regular Articles
  106. A new branch and bound algorithm for minimax ratios problems
  107. Regular Articles
  108. Upper bound estimate of incomplete Cochrane sum
  109. Regular Articles
  110. Value distributions of solutions to complex linear differential equations in angular domains
  111. Regular Articles
  112. The nonlinear diffusion equation of the ideal barotropic gas through a porous medium
  113. Regular Articles
  114. The Sheffer stroke operation reducts of basic algebras
  115. Regular Articles
  116. Extensions and improvements of Sherman’s and related inequalities for n-convex functions
  117. Regular Articles
  118. Classification lattices are geometric for complete atomistic lattices
  119. Regular Articles
  120. Possible numbers of x’s in an {x, y}-matrix with a given rank
  121. Regular Articles
  122. New error bounds for linear complementarity problems of weakly chained diagonally dominant B-matrices
  123. Regular Articles
  124. Boundedness of vector-valued B-singular integral operators in Lebesgue spaces
  125. Regular Articles
  126. On the Golomb’s conjecture and Lehmer’s numbers
  127. Regular Articles
  128. Some applications of the Archimedean copulas in the proof of the almost sure central limit theorem for ordinary maxima
  129. Regular Articles
  130. Dual-stage adaptive finite-time modified function projective multi-lag combined synchronization for multiple uncertain chaotic systems
  131. Regular Articles
  132. Corrigendum to: Dual-stage adaptive finite-time modified function projective multi-lag combined synchronization for multiple uncertain chaotic systems
  133. Regular Articles
  134. Convergence and stability of generalized φ-weak contraction mapping in CAT(0) spaces
  135. Regular Articles
  136. Triple solutions for a Dirichlet boundary value problem involving a perturbed discrete p(k)-Laplacian operator
  137. Regular Articles
  138. OD-characterization of alternating groups Ap+d
  139. Regular Articles
  140. On Jordan mappings of inverse semirings
  141. Regular Articles
  142. On generalized Ehresmann semigroups
  143. Regular Articles
  144. On topological properties of spaces obtained by the double band matrix
  145. Regular Articles
  146. Representing derivatives of Chebyshev polynomials by Chebyshev polynomials and related questions
  147. Regular Articles
  148. Chain conditions on composite Hurwitz series rings
  149. Regular Articles
  150. Coloring subgraphs with restricted amounts of hues
  151. Regular Articles
  152. An extension of the method of brackets. Part 1
  153. Regular Articles
  154. Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs
  155. Regular Articles
  156. Strong edge geodetic problem in networks
  157. Regular Articles
  158. Ricci solitons on almost Kenmotsu 3-manifolds
  159. Regular Articles
  160. Uniqueness of meromorphic functions sharing two finite sets
  161. Regular Articles
  162. On the fourth-order linear recurrence formula related to classical Gauss sums
  163. Regular Articles
  164. Dynamical behavior for a stochastic two-species competitive model
  165. Regular Articles
  166. Two new eigenvalue localization sets for tensors and theirs applications
  167. Regular Articles
  168. Îş-strong sequences and the existence of generalized independent families
  169. Regular Articles
  170. Commutators of Littlewood-Paley gκ∗ -functions on non-homogeneous metric measure spaces
  171. Regular Articles
  172. On decompositions of estimators under a general linear model with partial parameter restrictions
  173. Regular Articles
  174. Groups and monoids of Pythagorean triples connected to conics
  175. Regular Articles
  176. Hom-Lie superalgebra structures on exceptional simple Lie superalgebras of vector fields
  177. Regular Articles
  178. Numerical methods for the multiplicative partial differential equations
  179. Regular Articles
  180. Solvable Leibniz algebras with NFn⊕ Fm1 nilradical
  181. Regular Articles
  182. Evaluation of the convolution sums ∑al+bm=n lσ(l) σ(m) with ab ≤ 9
  183. Regular Articles
  184. A study on soft rough semigroups and corresponding decision making applications
  185. Regular Articles
  186. Some new inequalities of Hermite-Hadamard type for s-convex functions with applications
  187. Regular Articles
  188. Deficiency of forests
  189. Regular Articles
  190. Perfect codes in power graphs of finite groups
  191. Regular Articles
  192. A new compact finite difference quasilinearization method for nonlinear evolution partial differential equations
  193. Regular Articles
  194. Does any convex quadrilateral have circumscribed ellipses?
  195. Regular Articles
  196. The dynamic of a Lie group endomorphism
  197. Regular Articles
  198. On pairs of equations in unlike powers of primes and powers of 2
  199. Regular Articles
  200. Differential subordination and convexity criteria of integral operators
  201. Regular Articles
  202. Quantitative relations between short intervals and exceptional sets of cubic Waring-Goldbach problem
  203. Regular Articles
  204. On θ-commutators and the corresponding non-commuting graphs
  205. Regular Articles
  206. Quasi-maximum likelihood estimator of Laplace (1, 1) for GARCH models
  207. Regular Articles
  208. Multiple and sign-changing solutions for discrete Robin boundary value problem with parameter dependence
  209. Regular Articles
  210. Fundamental relation on m-idempotent hyperrings
  211. Regular Articles
  212. A novel recursive method to reconstruct multivariate functions on the unit cube
  213. Regular Articles
  214. Nabla inequalities and permanence for a logistic integrodifferential equation on time scales
  215. Regular Articles
  216. Enumeration of spanning trees in the sequence of DĂźrer graphs
  217. Regular Articles
  218. Quotient of information matrices in comparison of linear experiments for quadratic estimation
  219. Regular Articles
  220. Fourier series of functions involving higher-order ordered Bell polynomials
  221. Regular Articles
  222. Simple modules over Auslander regular rings
  223. Regular Articles
  224. Weighted multilinear p-adic Hardy operators and commutators
  225. Regular Articles
  226. Guaranteed cost finite-time control of positive switched nonlinear systems with D-perturbation
  227. Regular Articles
  228. A modified quasi-boundary value method for an abstract ill-posed biparabolic problem
  229. Regular Articles
  230. Extended Riemann-Liouville type fractional derivative operator with applications
  231. Topical Issue on Topological and Algebraic Genericity in Infinite Dimensional Spaces
  232. The algebraic size of the family of injective operators
  233. Topical Issue on Topological and Algebraic Genericity in Infinite Dimensional Spaces
  234. The history of a general criterium on spaceability
  235. Topical Issue on Topological and Algebraic Genericity in Infinite Dimensional Spaces
  236. On sequences not enjoying Schur’s property
  237. Topical Issue on Topological and Algebraic Genericity in Infinite Dimensional Spaces
  238. A hierarchy in the family of real surjective functions
  239. Topical Issue on Topological and Algebraic Genericity in Infinite Dimensional Spaces
  240. Dynamics of multivalued linear operators
  241. Topical Issue on Topological and Algebraic Genericity in Infinite Dimensional Spaces
  242. Linear dynamics of semigroups generated by differential operators
  243. Special Issue on Recent Developments in Differential Equations
  244. Isomorphism theorems for some parabolic initial-boundary value problems in HĂśrmander spaces
  245. Special Issue on Recent Developments in Differential Equations
  246. Determination of a diffusion coefficient in a quasilinear parabolic equation
  247. Special Issue on Recent Developments in Differential Equations
  248. Homogeneous two-point problem for PDE of the second order in time variable and infinite order in spatial variables
  249. Special Issue on Recent Developments in Differential Equations
  250. A nonlinear plate control without linearization
  251. Special Issue on Recent Developments in Differential Equations
  252. Reduction of a Schwartz-type boundary value problem for biharmonic monogenic functions to Fredholm integral equations
  253. Special Issue on Recent Developments in Differential Equations
  254. Inverse problem for a physiologically structured population model with variable-effort harvesting
  255. Special Issue on Recent Developments in Differential Equations
  256. Existence of solutions for delay evolution equations with nonlocal conditions
  257. Special Issue on Recent Developments in Differential Equations
  258. Comments on behaviour of solutions of elliptic quasi-linear problems in a neighbourhood of boundary singularities
  259. Special Issue on Recent Developments in Differential Equations
  260. Coupled fixed point theorems in complete metric spaces endowed with a directed graph and application
  261. Special Issue on Recent Developments in Differential Equations
  262. Existence of entropy solutions for nonlinear elliptic degenerate anisotropic equations
  263. Special Issue on Recent Developments in Differential Equations
  264. Integro-differential systems with variable exponents of nonlinearity
  265. Special Issue on Recent Developments in Differential Equations
  266. Elliptic operators on refined Sobolev scales on vector bundles
  267. Special Issue on Recent Developments in Differential Equations
  268. Multiplicity solutions of a class fractional SchrĂśdinger equations
  269. Special Issue on Recent Developments in Differential Equations
  270. Determining of right-hand side of higher order ultraparabolic equation
  271. Special Issue on Recent Developments in Differential Equations
  272. Asymptotic approximation for the solution to a semi-linear elliptic problem in a thin aneurysm-type domain
  273. Topical Issue on Metaheuristics - Methods and Applications
  274. Learnheuristics: hybridizing metaheuristics with machine learning for optimization with dynamic inputs
  275. Topical Issue on Metaheuristics - Methods and Applications
  276. Nature–inspired metaheuristic algorithms to find near–OGR sequences for WDM channel allocation and their performance comparison
  277. Topical Issue on Cyber-security Mathematics
  278. Monomial codes seen as invariant subspaces
  279. Topical Issue on Cyber-security Mathematics
  280. Expert knowledge and data analysis for detecting advanced persistent threats
  281. Topical Issue on Cyber-security Mathematics
  282. Feedback equivalence of convolutional codes over finite rings
Downloaded on 9.9.2025 from https://www.degruyterbrill.com/document/doi/10.1515/math-2017-0093/html
Scroll to top button