DFT for cyclic code over \(F_p+ uF_p+\cdots+ u^{k-1}F_p\)

DOI10.1007/BF02896468zbMath1105.94016MaRDI QIDQ854425

Shi-Xin Zhu, Jian-Fa Qian, Li-Na Zhang

Publication date: 4 December 2006

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

zbMATH Keywords

discrete Fourier transformMS polynomial

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Numerical methods for discrete and fast Fourier transforms (65T50) Cyclic codes (94B15) Structure of finite commutative rings (13M05)

Cites Work

• Unnamed Item
• Unnamed Item
• Cyclic codes over the integers modulo \(p^m\).
• Transform domain characterization of cyclic codes over \(\mathbb{Z}_ m\)
• Modular and \(p\)-adic cyclic codes
• A transform approach to permutation groups of cyclic codes over Galois rings
• Transform domain characterization of abelian codes
• Decoding of cyclic codes over F/sub 2/+uF/sub 2/
• Optimal large linear complexity frequency hopping patterns derived from polynomial residue class rings
• Cyclic codes and self-dual codes over F/sub 2/+uF/sub 2/
• A generalized DFT for Abelian codes over Z/sub m/

This page was built for publication: DFT for cyclic code over \(F_p+ uF_p+\cdots+ u^{k-1}F_p\)