Cyclic codes over R = F_p + uF_p + + u^k - 1F_p with length p^sn
This paper generalizes the main results of \textit{S. T. Dougherty} and \textit{S. Ling} see [Des. Codes Cryptography 39, No. 2, 127--153 (2006; Zbl 1172.94637)] to the ring \(R=\mathbb F_p +u \mathbb F_p +\ldots+u^{k-1}\mathbb F_p\) (with \(p\) prime) and continues the study of repeated-root cyclic codes of \textit{Ping} and \textit{Zhu} and of \textit{Zhu, Ling} and \textit{Wu} [Electron.\ Inform.Technol.\ 29, 1124--1126 (2007) or 30, 1394--1396 (2008)] respectively. All cyclic codes of length \(p^sn\) (with \(n\) prime to \(p\)) over \(R\) are classified by determining the structure of ideals over an extension ring \(S_{u^k}(m,\omega)=\) GR\((u^k,m)/<\omega^{p^s}-1>\) of the Galois ring GR\((u^k,m)\) and by constructing a ring isomorphism \(\gamma\) between \(R[X]/(X^N-1)\) and \(\bigoplus\limits_{h\in I} S_{u^k}(m_h,\omega)\) using discrete Fourier transform; (here \(I\) is a complete set of \(p\)-cyclotomic coset representatives modulo \(n\)). Via \(\gamma^{-1}\), the cyclic codes of over \(R\) are characterized in terms of their generator polynomials.
- On the cyclic codes over \(F_P+uF_P+\cdots+u^{k-1}F_P\)
- Cyclic codes of arbitrary length over \(\mathbb F_q+u\mathbb F_q+u^2\mathbb F_q+\dots+u^{k-1}\mathbb F_q\)
- \((1 - u)\)-cyclic codes over \({F_{p^k}} + uF_{p^k}\)
- scientific article; zbMATH DE number 5284324
- Cyclic codes over ring F_p+u F_p
- Cyclic codes of arbitrary lengths over the ring F_q+uF_q+u^2F_q
- Cyclic codes of arbitrary lengths over the ring F_q+uF_q
- On \((1-u^2)\)-cyclic codes over \(F_{p^k}+uF_{p^k}+ u^2 F_{p^k}\)
- Cyclic codes over \(R_{k}\)
- On cyclic codes over \(\mathbb F_{p^k}+v\mathbb F_{p^k}+v^2\mathbb F_{p^k}+\cdots +v^r\mathbb F_{p^k}\)
- Constacyclic codes over ring \(F_q+uF_q+\cdots +u^{s-1}F_q\)
- Cyclic codes and self-dual codes over F/sub 2/+uF/sub 2/
- Cyclic codes over \(\mathbb Z_4\) of even length
- Cyclic codes over \(\mathbb{Z}_{4}\) of oddly even length.
- Fast, prime factor, discrete Fourier transform algorithms over \(\text{GF}(2^m)\) for \(8 \leqslant m \leqslant 10\)
- High speed decoding of the binary \((47, 24, 11)\) quadratic residue code
- On self-dual ternary codes and their coordinate ordering.
- On the generators of Z/sub 4/ cyclic codes of length 2/sup e/
- Optimal large linear complexity frequency hopping patterns derived from polynomial residue class rings
- Repeated-root cyclic codes
- Cyclic codes over the integers modulo p^m.
- A mass formula for cyclic codes over Galois rings of characteristic \(p^3\)
- Modular and \(p\)-adic cyclic codes
- The homogeneous distance of \((1+u^2)\)-constacyclic codes over \(\mathbb{F}_2[u]/\langle u^3\rangle\) and its applications
- \((1+\lambda u^2)\)-constacyclic codes of arbitrary length over \(F_{p^m}[u]/\langle u^3\rangle \)
- Complete classification of \((\delta + \alpha u^2)\)-constacyclic codes over \(\mathbb{F}_{2^m} [u]/\langle u^4 \rangle\) of oddly even length
- Construction of new quantum codes derived from constacyclic codes over \(\mathbb{F}_{q^2}+u\mathbb{F}_{q^2}+\cdots +u^{r-1}\mathbb{F}_{q^2}\)
- scientific article; zbMATH DE number 4014608 (Why is no real title available?)
- scientific article; zbMATH DE number 3920372 (Why is no real title available?)
- scientific article; zbMATH DE number 1406438 (Why is no real title available?)
- The cyclic codes of length \(5p^s\) over \(\mathbb{F}_{p^m}+u \mathbb{F}_{p^m}\) and their dual codes
- Cyclic codes of length \(p^n\) over \(\mathbb{Z}_{p^3}\)
- Cyclic codes over the ring of 4-adic integers of lengths 15, 17 and 19
- Cyclic \(R\)-additive codes
- Cyclic codes of length \(pn\) over \(Z_{p^2}\)
- Codes over certain rings
- Affine invariant and cyclic codes over p-adic numbers and finite rings
- On the classification of ideals over \(R[X]/\langle f(X)^{p^s}\rangle\) when \(R=\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}+\cdots+u^n\mathbb{F}_{p^m}\)
- Cyclic codes of length \(p^s\) over \(\frac{\mathbb{F}_{p^m}[u]}{\langle u^e \rangle}\)
- Complete classification of \((\delta +\alpha u^2)\)-constacyclic codes over \(\mathbb {F}_{3^m}[u]/\langle u^4\rangle \) of length \(3n\)
- On modular cyclic codes
This page was built for publication: Cyclic codes over \(R = F_p + uF_p + \cdots + u^{k - 1}F_p\) with length \(p^sn\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q632794)
