DFT for cyclic code over F_p+ uF_p++ u^k-1F_p
From MaRDI portal
Publication:854425
Recommendations
- Transform domain characterization of cyclic codes over \(\mathbb{Z}_ m\)
- A transform approach to polycyclic and serial codes over rings
- DFT domain characterization of quasi-cyclic codes
- scientific article; zbMATH DE number 2081123
- \(\mathbb F_q\)-linear cyclic codes over \(\mathbb F_{q^m}\): DFT approach
Cites work
- A generalized DFT for Abelian codes over Z/sub m/
- A transform approach to permutation groups of cyclic codes over Galois rings
- Cyclic codes and self-dual codes over F/sub 2/+uF/sub 2/
- Cyclic codes over the integers modulo p^m.
- Decoding of cyclic codes over F/sub 2/+uF/sub 2/
- scientific article; zbMATH DE number 3460471 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- Modular and \(p\)-adic cyclic codes
- Optimal large linear complexity frequency hopping patterns derived from polynomial residue class rings
- Transform domain characterization of abelian codes
- Transform domain characterization of cyclic codes over \(\mathbb{Z}_ m\)
Cited in
(8)- Transform domain characterization of cyclic codes over \(\mathbb{Z}_ m\)
- DFT domain characterization of quasi-cyclic codes
- A transform approach to polycyclic and serial codes over rings
- Spectral representation of cyclic codes over \(\mathbb{Z}_q\) of length \(N=p^kn\)
- scientific article; zbMATH DE number 3963725 (Why is no real title available?)
- scientific article; zbMATH DE number 2081123 (Why is no real title available?)
- A generalized DFT for Abelian codes over Z/sub m/
- scientific article; zbMATH DE number 847152 (Why is no real title available?)
This page was built for publication: DFT for cyclic code over \(F_p+ uF_p+\cdots+ u^{k-1}F_p\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q854425)
