Computer Engineering and Applications ›› 2010, Vol. 46 ›› Issue (2): 104-105.DOI: 10.3778/j.issn.1002-8331.2010.02.032

• 网络、通信、安全 • Previous Articles     Next Articles

New description of cyclic codes over galois rings

ZHANG Li-na   

  1. Department of Mathematics,Anhui University of Science and Technology,Huainan,Anhui 232001,China
  • Received:2008-07-24 Revised:2008-10-20 Online:2010-01-11 Published:2010-01-11
  • Contact: ZHANG Li-na

Galois环上循环码新的表示

张莉娜   

  1. 安徽理工大学 数理系,安徽 淮南 232001
  • 通讯作者: 张莉娜

Abstract: Galois rings may be of interesting in coding theory,which have already been studied by many coding theorists.In this paper,discrete Fourier transform and MS polynomial are defined for cyclic codes over Galois rings.A new description of cyclic codes over Galois rings is given.

Key words: cyclic code, Galois rings, Discrete Fourier Transform(DFT)

摘要: 近年来,在编码理论中,Galois环上码的研究成为编码理论工作者研究的一个热点。定义了Galois环上循环码的离散傅里叶变换及Mattson-Solomon(MS)多项式,证明了Galois环上的循环码同构于Galois环的Galois 扩张的理想。

关键词: 循环码, Galois环, 离散傅里叶变换

CLC Number: