Construction of One-Lee Weight Codes over FP+vFP+v2FP

Article Preview

Abstract:

This paper is devoted to the study of the algebraic structure of one-Lee weight codes over. We first give some necessary conditions for a code to be a one-Lee weight code over. Moreover, we present the method of the construction of one-Lee weight codes over. An example is given to illustrate the results.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 989-994)

Pages:

2634-2638

Citation:

Online since:

July 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] MacWilliams F. J., Sloane N. J. A. The Theory of Error Correcting Codes [M]. Amsterdam, North-Holland, (1977).

Google Scholar

[2] C. Carlet. One-weight -linear codes. Coding, Theory, Cryptography and Related Areas, Springer, 2000, 57-72.

DOI: 10.1007/978-3-642-57189-3_5

Google Scholar

[3] Minjia Shi, Good p-ary codes from one-weight codes over, Chinese Journal of Electronics,2013, 22(4)799-802.

Google Scholar

[4] Minjia Shi, Shixin Zhu, ShanlinYang, A class of optimal p-ary codes from one-weight codes over , The Journal of The Franklin Institute, 2013, 350(5)729-737.

Google Scholar

[5] Minjia Shi, Yan Liu, Several Weight Enumerators of Linear Codes and their MacWilliams identities over Ring , Acta Electronica Sinica, to appear in July, (2014).

Google Scholar

[6] MinJia Shi, Patrick Solé, Bo Wu. Cyclic codes and the weight enumerator of linear codes over [J]. Appl. Comput. Math, 2013, 12(2)247- 255.

Google Scholar