Next Article in Journal
Protecting Touch: Authenticated App-To-Server Channels for Mobile Devices Using NFC Tags
Previous Article in Journal
Information Mining from Heterogeneous Data Sources: A Case Study on Drought Predictions

Metrics 0

## Export Article

Information 2017, 8(3), 80; doi:10.3390/info8030080

Article
On the Problem of the Existence of a Square Matrix U Such That UUT = − I over ℤpm
School of Liberal Arts, KoreaTec, Cheonan 31253, Korea
Received: 17 May 2017 / Accepted: 29 June 2017 / Published: 4 July 2017

## Abstract

:
Building-up construction is one of several methods for constructing self-dual codes. Recently, a new building-up construction method has been developed by S. Han, in which the existence of a square matrix U such that $U U T = − I$ is essential. In this paper, we completely solve the existence problem for U over $Z p m$, where p is an arbitrary prime number.
Keywords:
building-up construction; self-dual code; ℤpm code

## 1. Introduction

Coding theory has been developing since the 1950s. There are many interesting classes of codes, such as cyclic codes, MDS (Maximum Distance Separable) codes, algebraic geometry codes, and self-dual codes. Among them, self-dual codes are very interesting, as they are closely related to other areas of mathematics, such as block designs, lattices, modular forms, and sphere packings. Moreover, they are of interest in their own right (e.g., [1]).
There are many construction methods for self-dual codes, such as the gluing vector [2], balance principal [3], double circulant [4], and building-up construction methods. In this paper, we are concerned with the building-up construction method, which was introduced by M. Harada [5] and was subsequently formalized and named by J.-L. Kim for self-dual codes over the finite field $F 2$ [6]. It was further developed for self-dual codes over the finite field $F q$, where q is a power of 2 or $q ≡ 1$ (mod 4) [7] and $q ≡ 3$ (mod 4) [8]. It was also applied to related rings [9,10,11,12,13,14].
However, there was an important missing case in previous building-up constructions; namely, $Z 4$. This case was covered using matrices [15], where the method was formulated in the context of finite chain rings, including all previous cases as well as $Z 4$. One of the key points is the existence of a square matrix U such that $U U T = − I$. The corresponding problem over $Z 2 m$ was completely solved, except for the following open case [15]: is there a $( 4 t + 2 ) × ( 4 t + 2 )$ matrix U such that $U U T = − I$ over $Z 2 m$ $( m ≥ 2 )$ for all $t ≥ 1$?
In this paper, we settle this open case. Furthermore, we solve the problem of the existence of a square matrix U such that $U U T = − I$ over $Z p m$, where p is an arbitrary prime number.
The paper is organized as follows. In Section 2, we state the preliminaries. In Section 3, we present the non-existence proof for a $( 4 t + 2 ) × ( 4 t + 2 )$ matrix U such that $U U T = − I$ over $Z 2 m$ $( m ≥ 2 )$ for all $t ≥ 0$. In Section 4, we study the existence problem for a matrix U over $Z p m$, where p is an odd prime. Therefore, we completely solve the problem of the existence of a square matrix U such that $U U T = − I$ over $Z p m$, where p is an arbitrary prime number. In Section 5, we provide examples of the construction of self-dual codes using the result in Section 4.
Remark 1.
The square matrix U such that $U U T = − I$ over finite fields was considered by J.L. Massey [16]. He called the matrix U antiorthogonal. Using the antiorthogonal matrix, he characterized the self-dual codes and constructed linear codes with complementary duals (LCD codes). In [17], Massey considered the existence problem of antiorthogonal matrices over finite fields.

## 2. Preliminaries

Throughout this paper, R is a finite commutative ring with identity $1 ≠ 0$. An R-submodule $C ⊆ R n$ is called a linear code of length n over R. Unless otherwise specified, all codes are assumed to be linear.
For $x , y ∈ R n$, we define the usual inner product by
$x × y = x 1 y 1 + … + x n y n .$
For a code C of length n over R, let
$C ⊥ = { x ∈ R n | x × c = 0 , ∀ c ∈ C }$
be the dual code of C. If $C ⊆ C ⊥$, then we say that C is self-orthogonal, and if $C = C ⊥$, then C is self-dual.
The following construction method for self-dual codes over R appears in [15].
Theorem 1.
[15] Let R be a finite chain ring, $C 0$ a self-dual code of length n over R, and $G 0$ a $k × n$ generator matrix for $C 0$. Let $a ≥ 1$ be an integer, and X an $a × n$ matrix over R such that $X X T = − I$. Let U be an $a × a$ matrix over R such that $U U T = − I$, and O the $a × a$ zero matrix. Then, the matrix
$G = I O X − G 0 X T G 0 X T U G 0$
generates a self-dual code C of length $n + 2 a$ over R.
To apply Theorem 1 to self-dual codes over R, we should have an $a × a$ matrix U and an $a × n$ matrix X such that $U U T = − I$ and $X X T = − I$. For $1 ≤ a ≤ n$, if there exists an $a × a$ matrix U such that $U U T = − I$, then there exists an $a × n$ matrix X such that $X X T = − I$. Here is the proof. Let $X = [ U | O ]$, where O is the $a × ( n − a )$ zero matrix. Then, $X X T = U U T + O O T = − I$. Therefore, we focus on the problem of the existence of an $a × a$ matrix U such that $U U T = − I$.
In [15], the existence of an $a × a$ matrix U such that $U U T = − I$ over $Z 2 m$ has been studied. We state the relevant result.
Theorem 2.
[15] For the existence of an $a × a$ matrix U over $Z 2 m$ such that $U U T = − I$, we have the following.
• If $m = 1$, then there exists such U for all $a ≥ 1$.
• If $m ≥ 2$ and $a = 4 t$, then there exists such U for all $t ≥ 1$.
• If $m ≥ 2$ and $a = 2$, then no such U exists.
• If $m ≥ 2$ and $a = 2 t + 1$, then no such U exists for all $t ≥ 0$.
In Theorem 2, the missing case is $m ≥ 2$ and $a = 4 t + 2 , ( t ≥ 1 )$. This leads to the following open problem [15]: Let $a = 4 t + 2$ for some positive integer $t ≥ 1$. Is there an $a × a$ matrix U such that $U U T = − I$ over $Z 2 m$ $( m ≥ 2 )$? This problem is solved in the following section.

## 3. Nonexistence of a $( 4 t + 2 ) × ( 4 t + 2 )$ Matrix U Such That $U U T = − I$ over $Z 2 m$$( m ≥ 2 )$ for All $t ≥ 0$

In this section, we solve the open problem in [15] by proving that there is no $( 4 t + 2 ) × ( 4 t + 2 )$ matrix U such that $U U T = − I$ over $Z 2 m$ $( m ≥ 2 )$ for all $t ≥ 0$. We start with the following lemma.
Lemma 1.
If there is an $a × a$ matrix U such that $U U T = − I$ over $Z 2 m$, then U satisfies $U U T = − I$ over $Z 2 n$ for $1 ≤ n ≤ m$.
Proof.
Let $U = ( u i j )$ ($1 ≤ i , j ≤ a$). Suppose that $U U T = − I$ over $Z 2 m$. Then
$u i 1 u 1 j + u i 2 u 2 j + … + u i a u a j ≡ − δ i j ( mod 2 m ) ( 1 ≤ i , j ≤ a ) ,$
where
$δ i j = 1 if i = j 0 else .$
Therefore, we have
$u i 1 u 1 j + u i 2 u 2 j + … + u i a u a j ≡ − δ i j ( mod 2 n ) ( 1 ≤ i , j ≤ a )$
for $1 ≤ n ≤ m$. So, $U U T = − I$ over $Z 2 n$ for $1 ≤ n ≤ m$. ☐
Corollary 1.
If there is no $a × a$ matrix U such that $U U T = − I$ over $Z 4$, then there is no $a × a$ matrix U such that $U U T = − I$ over $Z 2 m$ for $m ≥ 2$.
Proof.
The statement is the contrapositive of Lemma 1. ☐
The proof of the main theorem in this section is related to self-dual binary codes. A self-dual binary code whose codewords have weight divisible by four is called doubly even or Type II; a self-dual code with at least one codeword of weight not divisible by 4 is called singly even or Type I. The following lemma is well-known (see [18] (p. 454) for example).
Lemma 2.
Type II codes exist only for lengths that are multiples of eight.
We are ready to prove the main theorem of this section.
Theorem 3.
Let $a = 4 t + 2$ for some non-negative integer $t ≥ 0$. Then, there is no $a × a$ matrix U such that $U U T = − I$ over $Z 2 m$ $( m ≥ 2 )$.
Proof.
By Corollary 1, it is sufficient to prove that there is no $a × a$ matrix U such that $U U T = − I$ over $Z 4$. We assume that there is an $a × a$ matrix U such that $U U T = − I$ over $Z 4$. Let
$u i = ( u i 1 , u i 2 , … , u i a )$
be the i-th row of U. Since $u i × u i = − 1$ over $Z 4$, we have
$u i 1 2 + u i 2 2 + … + u i a 2 ≡ − 1 ( mod 4 ) .$
Let
$A = { j | u i j ≡ ± 1 ( mod 4 ) }$
and
$B = { j | u i j ≡ 0 , 2 ( mod 4 ) } .$
By Equation (5), we have
$| A | ≡ − 1 ( mod 4 ) .$
Since $U U T = − I$ over $Z 4$, we have $U U T = I$ over $Z 2$. For $j ∈ A$, we have $u i j ≡ 1 ( mod 2 )$, and for $j ∈ B$, we have $u i j ≡ 0 ( mod 2 )$. Let $w t ( u i )$ be the weight of $u i$ over $Z 2$. By Equation (8), we have
$w t ( u i ) ≡ − 1 ( mod 4 ) .$
We consider the matrix $G = [ I | U ]$ over $Z 2$. Then, G is $a × 2 a$; i.e., $( 4 t + 2 ) × ( 8 t + 4 )$ matrix. By Equation (9), each row of G has weight $w ≡ 0 ( mod 4 )$ over $Z 2$. Let C be the binary code generated by G. Then, C is a doubly even self-dual (Type II) code, since $G G T = O$ and the weight of each row of G is doubly even over $Z 2$. By Lemma 2, the code length of C should be a multiple of eight. However, the code length of C is $8 t + 4$. This leads to a contradiction. Therefore, there is no $a × a$ matrix U such that $U U T = − I$ over $Z 4$. This completes the proof. ☐
We update Theorem 2 using the previous theorem, and the case $Z 2 m$ is settled.
Theorem 4.
For the existence of an $a × a$ matrix U over $Z 2 m$ such that $U U T = − I$, we have the following.
• If $m = 1$, then there exists such U for all $a ≥ 1$.
• If $m ≥ 2$, then there exists such U if and only if a is a multiple of four.

## 4. On the Problem of the Existence of a Matrix U Such That $U U T = − I$ over $Z p m$, Where p Is an Odd Prime

In this section, we consider the existence problem of a matrix U such that $U U T = − I$ over $Z p m$, where p is an odd prime. We start with the following lemma, which can be found in elementary number theory books (see, for example, [19] (Theorem 8.10)).
Lemma 3.
An integer $n > 1$ has a primitive root if and only if
$n = 2 , 4 , p k , or 2 p k ,$
where p is an odd prime.
We consider two cases: $p ≡ 1 ( mod 4 )$ and $p ≡ − 1 ( mod 4 )$. If $p ≡ 1 ( mod 4 )$, we need the following lemma whose proof can be made using elementary number theory (see, for example, [14] (Lemma 2.1)).
Lemma 4.
Let p be an odd prime and m a positive integer. Then, $− 1$ is a square in $Z p m$ if and only if $p ≡ 1 ( mod 4 )$.
Proof.
$− 1$ is a square in $Z p m$ if and only if $( − 1 ) ϕ ( p m ) 2 ≡ 1 ( mod p m )$, where $ϕ$ is an Euler-phi function (see, for example, [19] (Theorem 8.12)). Equivalently, $( − 1 ) p m − 1 ( p − 1 ) 2 ≡ 1 ( mod p m )$ if and only if $p ≡ 1 ( mod 4 )$. ☐
If $p ≡ − 1 ( mod 4 )$, we first prove the following lemma, which is an integral part of the main theorem in this section.
Lemma 5.
Let $p ≡ − 1 ( mod 4 )$. Then, every unit of $Z p m$ can be written as a sum of two squares in $Z p m$.
Proof.
Let $Z p m *$ be the set of units of $Z p m$. By Lemma 3, there is a primitive root $β$ such that $Z p m * = 〈 β 〉$. Then, $| β | = p m − 1 ( p − 1 )$. We define $Q , N , M$ by the following:
$Q = { 0 , β 2 i | i = 1 , 2 , … , p m − 1 ( p − 1 ) 2 }$
$N = { β 2 i + 1 | i = 1 , 2 , … , p m − 1 ( p − 1 ) 2 }$
$M = { p × i | i = 1 , 2 , … , p m − 1 − 1 }$
Then, $Z p m = Q ∪ N ∪ M$.
We claim that Q is not closed under addition. We assume the contrary towards a contradiction. Since Q is finite, Q is an additive subgroup in $Z p m$. Therefore, $| Q |$ divides $| Z p m |$; i.e.,
$( p m − 1 × p − 1 2 + 1 ) | p m .$
Then,
$p | ( p m − 1 × p − 1 2 + 1 ) .$
This is a contradiction. Therefore, Q is not closed under addition. Thus, there are i and j such that $β 2 i + β 2 j ∉ Q$.
We claim that $β 2 i + β 2 j ∈ N$. We assume that $β 2 i + β 2 j ∉ N$. Then, $β 2 i + β 2 j ∈ M$ and $β 2 i + β 2 j = p k$ for some k. Hence, $β 2 i + β 2 j ≡ 0 ( mod p )$. Consequently, $β 2 i ≡ − β 2 j ( mod p )$. Thus, $− 1 ≡ ( β i − j ) 2 ( mod p )$. This is a contradiction, since $− 1$ is not a square by Lemma 4. Therefore, $β 2 i + β 2 j ∈ N$.
Thus, $β 2 i + β 2 j = β 2 k + 1$ for some k. Therefore, $β = ( β i − k ) 2 + ( β j − k ) 2$. Hence, for any l, $β 2 l = ( β l ) 2 + 0 2$ and $β 2 l + 1 = ( β l × β i − k ) 2 + ( β l × β j − k ) 2$. This completes the proof. ☐
We now state the main results in this section.
Theorem 5.
Let p be an odd prime. Then, for the existence of an $a × a$ matrix U over $Z p m$ such that $U U T = − I$, we have the following for all $m ≥ 1$.
• If $p ≡ 1 ( mod 4 )$, then there exists such U for all $a ≥ 1$.
• If $p ≡ − 1 ( mod 4 )$, then there exists such U if and only if a is even.
Proof.
We assume that $p ≡ 1 ( mod 4 )$. By Lemma 4, there is an element c in $Z p m$ such that $c 2 = − 1$. Let U be an $a × a$ diagonal matrix with all diagonal elements c; i.e,
$U = c 0 ⋱ 0 c .$
Then, $U U T = − I$. This proves the first statement.
We now assume that $p ≡ − 1 ( mod 4 )$. By Lemma 5, there exist $α , β$ such that $α 2 + β 2 = − 1$ in $Z p m$. Let
$U 2 = α β β − α .$
Then, $U 2 U 2 T = − I$. This proves that there is a $2 × 2$ matrix U such that $U U T = − I$. For $a = 2 t$, where $t ≥ 1$, let
$U a = U 2 0 ⋱ 0 U 2 .$
Then, $U a U a T = − I$.
Finally, we assume that there is an $a × a$ matrix U such that $U U T = − I$. Then, $det ( U U T ) = det ( − I )$, $( det U ) 2 = ( − 1 ) a$. Therefore, a should be even. This completes the proof. ☐

## 5. Examples

In this section, we provide examples of construction of self-dual codes over $Z p m$ using Theorem 1. For $p = 2$, examples can be found in [15]. For $p ≡ 1 ( mod 4 )$, they can be found in [14]. Therefore, we provide examples for $p ≡ − 1 ( mod 4 )$. All computations were performed with Magma [20].
Example 1.
A classification of self-dual codes over $Z 9$ appears in [21]. For code length $n = 2$, there is unique self-dual code with generator matrix
$G 0 = 3 0 0 3 .$
We apply Theorem 1 with
$U = X = 1 4 4 − 1 .$
Then, we have
$G = 1 0 0 0 1 4 0 1 0 0 4 8 6 6 6 0 3 0 6 3 0 6 0 3 .$
By elementary row operation in G, we obtain the standard form
$G 1 = 1 0 0 0 1 4 0 1 0 0 4 8 0 0 3 0 0 0 0 0 0 3 0 0 .$
Let C be the code generated by $G 1$. Then, it is easy to see that it is equivalent to the following code in [21]
$C 9 , 1 , 1 ⨁ C 9 , 1 , 1 ⨁ C 9 , 4 , 3 ,$
where $C 9 , 1 , 1$ is the code generated by the $1 × 1$ matrix
$( 3 )$
and $C 9 , 4 , 3$ is the code generated by the $2 × 4$ matrix
$1 0 8 5 0 1 5 1 .$
Example 2.
$C 49 , 4 , 3$ in [21] is the self-dual code of length 4 over $Z 49$ generated by the matrix
$G 0 = 1 4 4 4 0 7 0 42 0 0 7 42 .$
We apply Theorem 1 with
$U = 2 17 17 − 2 and X = 1 1 39 17 10 17 1 48 .$
Then, we have
$G = 1 0 0 0 1 1 39 17 0 1 0 0 10 17 1 48 16 20 20 13 1 4 4 4 14 21 7 0 0 7 0 42 42 35 7 42 0 0 7 42$
By elementary row operation in G, we obtain the standard form
$G 1 = 1 0 0 0 1 1 39 17 0 1 0 0 3 24 29 27 0 0 1 1 5 23 45 45 0 0 0 7 0 0 7 7 0 0 0 0 7 42 21 21 .$
Let C be the code generated by $G 1$. Then, C is a self-dual code of length 8. We cannot compare this code with those in [21], since the classification in [21] has been carried out up to code length 6.

## Acknowledgments

The author wish to thank the reviewers for valuable remarks which helped to improve this article. The author was supported by the 2017 Professor Education and Research Promotion Program of KoreaTech.

## Conflicts of Interest

The author declares no conflict of interest.

## References

1. Rains, E.; Sloane, N.J.A. Self-Dual Codes. In Handbook of Coding Theory; Pless, V.S., Huffman, W.C., Eds.; Elsevier: Amsterdam, The Netherlands, 1998. [Google Scholar]
2. Conway, J.H.; Pless, V. On the enumeration of self-dual codes. J. Comb. Theory Ser. A 1980, 28, 26–53. [Google Scholar] [CrossRef]
3. Huffman, W.C.; Pless, V.S. Fundamentals of Error-correcting Codes; Cambridge University Press: Cambridge, UK, 2003. [Google Scholar]
4. Grassl, M.; Gulliver, T.A. On circulant self-dual codes over small fields. Des. Codes Cryptogr. 2009, 52, 57–81. [Google Scholar] [CrossRef]
5. Harada, M. The existence of a self-dual [70, 35, 12] code and formally self-dual codes. Finite Fields Appl. 1997, 3, 131–139. [Google Scholar] [CrossRef]
6. Kim, J.-L. New extremal self-dual codes of lengths 36, 38, and 58. IEEE Trans. Inf. Theory 2001, 47, 386–393. [Google Scholar]
7. Kim, J.-L.; Lee, Y. Euclidean and Hermitian self-dual MDS codes over large finite fields. J. Comb. Theory Ser. A 2004, 105, 79–95. [Google Scholar] [CrossRef]
8. Kim, J.-L.; Lee, Y. An Efficient Construction of Self Dual Codes. Bull. Korean Math. Soc. 2015, 52, 915–923. [Google Scholar] [CrossRef]
9. Alfaro, R.; Dhul-Qarnayn, K. Constructing Self-Dual codes over $F$q[u]/(ut). Des. Codes Cryptogr. 2015, 74, 453–465. [Google Scholar] [CrossRef]
10. Dougherty, S.T.; Kim, J.-L.; Kulosman, H.; Liu, H. Self-dual codes over commutative Frobenius rings. Finite Fields Appl. 2010, 16, 14–26. [Google Scholar] [CrossRef]
11. Dougherty, S.T.; Kim, J.-L.; Liu, H. Constructions of Self-dual Codes over Finite Commutative Chain Rings. Int. J. Inf. Codin. Theory 2010, 1, 171–190. [Google Scholar] [CrossRef]
12. Han, S.; Lee, H.; Lee, Y. Construction of Self Dual Codes over $F$2 + u$F$2. Bull. Korean Math. Soc. 2012, 49, 135–143. [Google Scholar] [CrossRef]
13. Kim, J.-L.; Lee, Y. Construction of MDS Self-dual codes over Galois rings. Des. Codes Cryptogr. 2007, 45, 247–258. [Google Scholar] [CrossRef]
14. Lee, H.; Lee, Y. Construction of self-dual codes over finite rings ℤpm. J. Comb. Theory Ser. A 2008, 115, 407–422. [Google Scholar] [CrossRef]
15. Han, S. A method for costructing self-dual codes over ℤ2m. Des. Codes Cryptogr. 2015, 75, 253–262. [Google Scholar] [CrossRef]
16. Massey, J.L. Orthogonal, antiorthogonal and self-orthogonal matrices and their codes. Commun. Codin. 1998, 2, 3. [Google Scholar]
17. Massey, J.L. On Antiorthogonal Matrices and Their Codes. In Proceedings of the 1998 IEEE International Symposium on Information Theory (ISIT), Cambridge, MA, USA, 16–21 August 1998. [Google Scholar]
18. Huffman, W.C. On the classification and enumeration of self-dual codes. Finite Fields Appl. 2005, 11, 451–490. [Google Scholar] [CrossRef]
19. Burton, D.M. Elementary Number Theory, 6th ed.; McGraw-Hill International Edition; McGraw-Hill: New York, NY, USA, 2007. [Google Scholar]
20. Bosma, W.; Cannon, J.; Playoust, C. The Magma algebra system. I. The user language. J. Symbolic Comput. 1997, 24, 235–265. [Google Scholar] [CrossRef]
21. Balmaceda, J.M.P.; Betty, R.A.L.; Nemenzo, F.R. Mass formula for self-dual codes over ℤp2. Discret. Math. 2017, 308, 2984–3002. [Google Scholar] [CrossRef]