On the problem of the existence of a square matrix U such that UUT = -I over Zpm

被引：2
作者：
Han S. [1 ]
机构：
[1] School of Liberal Arts, KoreaTec, Cheonan
来源：
Information (Switzerland) | 2017年 / 8卷 / 03期
关键词：
Building-up construction; Self-dual code; Z[!sub]p[!/sub]m code;
D O I：
10.3390/info8030080
中图分类号：
学科分类号：
摘要：
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 UUT = -I is essential. In this paper, we completely solve the existence problem for U over Zpm, where p is an arbitrary prime number.
引用
收藏
相关论文
共 21 条
[1]  
Rains E., Sloane N.J.A., Self-Dual Codes, Handbook of Coding Theory, (1998)
[2]  
Conway J.H., Pless V., On the enumeration of self-dual codes, J. Comb. Theory Ser. A, 28, pp. 26-53, (1980)
[3]  
Huffman W.C., Pless V.S., Fundamentals of Error-correcting Codes, (2003)
[4]  
Grassl M., Gulliver T.A., On circulant self-dual codes over small fields, Des. Codes Cryptogr., 52, pp. 57-81, (2009)
[5]  
Harada M., The existence of a self-dual [70, 35, 12] code and formally self-dual codes, Finite Fields Appl., 3, pp. 131-139, (1997)
[6]  
Kim J.-L., New extremal self-dual codes of lengths 36, 38, and 58, IEEE Trans. Inf. Theory, 47, pp. 386-393, (2001)
[7]  
Kim J.-L., Lee Y., Euclidean and Hermitian self-dual MDS codes over large finite fields, J. Comb. Theory Ser. A, 105, pp. 79-95, (2004)
[8]  
Kim J.-L., Lee Y., An Efficient Construction of Self Dual Codes, Bull. Korean Math. Soc., 52, pp. 915-923, (2015)
[9]  
Alfaro R., Dhul-Qarnayn K., Constructing Self-Dual codes over F<sub>q</sub>[u]/(u<sup>t</sup>), Des. Codes Cryptogr., 74, pp. 453-465, (2015)
[10]  
Dougherty S.T., Kim J.-L., Kulosman H., Liu H., Self-dual codes over commutative Frobenius rings, Finite Fields Appl., 16, pp. 14-26, (2010)
123