首页 | 本学科首页   官方微博 | 高级检索  
     检索      

THE HAMMING DISTANCES OF NEGACYCLIC CODES OF LENGTH 2^s OVER GR (2^α, m)
作者姓名:Shixin  ZHU  Xiaoshan  KAI
作者单位:Department of Applied Mathematics, Hefei University of Technology, Hefei 230009, China.
基金项目:The research is supported by the National Natural Science Foundation of China under Grant No. 60673074.
摘    要:The Hamming distances of all negacyclic codes of length 28 over the Gaiois ring GR (2^α, m) are given. In particular, the Lee distances of all negacyclic codes over Z4 of length 2^s are obtained. The Gray images of such negacyclic codes over Z4 are also determined under the Gray map.

关 键 词:加重平衡  节点  地图  测量技术
收稿时间:08 January 2007

The Hamming Distances of Negacyclic Codes of Length 2 s over GR (2 a , m )
Shixin ZHU Xiaoshan KAI.The Hamming Distances of Negacyclic Codes of Length 2 s over GR (2 a , m )[J].Journal of Systems Science and Complexity,2008,21(1):60-66.
Authors:Shixin Zhu and Xiaoshan Kai
Institution:(1) Department of Applied Mathematics, Hefei University of Technology, Hefei, 230009, China
Abstract:The Hamming distances of all negacyclic codes of length 2 s over the Galois ring GR(2 a ,m) are given. In particular, the Lee distances of all negacyclic codes over Z 4 of length 2 s are obtained. The Gray images of such negacyclic codes over Z 4 are also determined under the Gray map. The research is supported by the National Natural Science Foundation of China under Grant No. 60673074.
Keywords:Gray map  Hamming distances  Hamming weights  negacyclic codes
本文献已被 维普 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号