DFT for cyclic code overF
p
+uF
p
+ ··· +u
k-1
F
p |
| |
| Authors: | Jianfa Qian Lina Zhang Shixin Zhu |
| |
| Institution: | 1. Department of Mathematics and Physics, Anhui University of Science and Technology, Huainan, 232001, Anhui, P. R. China
2. Department of Applied Mathematics, Hefei University of Technology, Hefei, 230009, Anhui, P. R. China
|
| |
| Abstract: | The transform domain characterization of cyclic codes over finite fields using Discrete Fourier Transform(DFT) over an appropriate extension field is well known. In this paper, we extend this transform domain characterization for cyclic codes overF p +uF p + ··· +u k-1 F p . We give a way to characterize cyclic codes overF p +uF p + ··· +u k-1 F p by Mattson-Solomon polynomials and multiple defining sets. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
