全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

Hermitian Self-Orthogonal Constacyclic Codes over Finite Fields

DOI: 10.1155/2014/985387

Full-Text   Cite this paper   Add to My Lib

Abstract:

Necessary and sufficient conditions for the existence of Hermitian self-orthogonal constacyclic codes of length over a finite field , coprime to , are found. The defining sets and corresponding generator polynomials of these codes are also characterised. A formula for the number of Hermitian self-orthogonal constacyclic codes of length over a finite field is obtained. Conditions for the existence of numerous MDS Hermitian self-orthogonal constacyclic codes are obtained. The defining set and the number of such MDS codes are also found. 1. Introduction Let denote a finite field with elements. An linear code of length and dimension over is a -dimensional subspace of the vector space . Elements of the subspace are called codewords and are written as row vectors . A linear code over is called -constacyclic if is in for every in . Let be the map given by . One can easily check that is an -module isomorphism. We can therefore identify -constacyclic codes of length over with ideals in . The Hamming weight of is the number of nonzero coordinates of . The minimum distance of is defined to be . An code, that is, a linear code with minimum distance , is said to be maximum distance separable (MDS) if . The Hermitian inner product of elements is defined as , for and . For a linear code of length over , the Hermitian dual code of is defined by . If , then is known as Hermitian self-dual and is Hermitian self-orthogonal if . Aydin et al. [1] dealt with constacyclic codes and a constacyclic BCH bound was given. Gulliver et al. [2] showed that there exists Euclidean self-dual MDS code of length over when by using a Reed-Solomon (RS) code and its extension. They also constructed many new Euclidean and Hermitian self-dual MDS codes over finite fields. Blackford [3] studied negacyclic codes over finite fields by using multipliers. He gave conditions on the existence of Euclidean self-dual codes. Recently, Guenda [4] constructed MDS Euclidean and Hermitian self-dual codes from extended cyclic duadic or negacyclic codes and gave necessary and sufficient conditions on the existence of Hermitian self-dual negacyclic codes arising from negacyclic codes. In [5] the authors gave formulae to enumerate the number of Euclidean self-dual and self-orthogonal negacyclic codes of length over a finite field , where is coprime to . In [6] Yang and Cai gave the necessary and sufficient conditions for the existence of Hermitian self-dual constacyclic codes. They also gave some conditions under which Hermitian self-dual and self-orthogonal MDS codes exist. In this paper, we find necessary and

References

[1]  N. Aydin, I. Siap, and D. K. Ray-Chaudhuri, “The structure of 1-generator quasi-twisted codes and new linear codes,” Designs, Codes and Cryptography, vol. 24, no. 3, pp. 313–326, 2001.
[2]  T. A. Gulliver, J.-L. Kim, and Y. Lee, “New MDS or near-MDS self-dual codes,” IEEE Transactions on Information Theory, vol. 54, no. 9, pp. 4354–4360, 2008.
[3]  T. Blackford, “Negacyclic duadic codes,” Finite Fields and Their Applications, vol. 14, no. 4, pp. 930–943, 2008.
[4]  K. Guenda, “New MDS self-dual codes over finite fields,” Designs, Codes and Cryptography, vol. 62, no. 1, pp. 31–42, 2012.
[5]  A. Sahni and P. T. Sehgal, “Enumeration of self-dual and self-orthogonal negacyclic codes over finite fields,” In press.
[6]  Y. Yang and W. Cai, “On self-dual constacyclic codes over finite fields,” Designs, Codes, and Cryptography, 2013.
[7]  H. Q. Dinh and S. R. Lopez-Permouth, “Cyclic and negacyclic codes over finite chain rings,” IEEE Transactions on Information Theory, vol. 50, no. 8, pp. 1728–1744, 2004.

Full-Text

comments powered by Disqus

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133

WeChat 1538708413