Journal of applied mathematics & informatics

한국전산응용수학회 (The Korean Society for Computational and Applied Mathematics)
권호 표지

DFT FOR CYCLIC CODE OVER $F_p + uF_p +... + u^{k-l}F_p$

  • Qian Jian-Fa (Department of Mathematics and Physics, Anhui University of Science and Technology) ;
  • Zhang Li-Na (Department of Mathematics and Physics, Anhui University of Science and Technology) ;
  • Zhu Shi-Xin (Department of Applied Mathematics, Hefei University of Technology)
  • 발행 : 2006.09.01

⟨ 이전 논문 다음 논문 ⟩

초록

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 over $F_p + uF_p +... + u^{k-l}F_p$. We give a way to characterize cyclic codes over $F_p + uF_p +... + u^{k-l}F_p$ by Mattson-Solomon polynomials and multiple defining sets.

키워드