On self-dual constacyclic codes of length \(p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
From MaRDI portal
Publication:1685981
DOI10.1016/j.disc.2017.08.044zbMath1401.94226OpenAlexW2758803038MaRDI QIDQ1685981
Yun Fan, Songsak Sriboonchitta, Hualu Liu, Xiu-sheng Liu, Hai Quang Dinh
Publication date: 20 December 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2017.08.044
Related Items
Duality of constacyclic codes of prime power length over the finite non-commutative chain ring \(\frac{ \mathbb{F}_{p^m} [ u , \theta }{ \langle u^2 \rangle} \)], RT distances and Hamming distances of constacyclic codes of length \(8p^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}\), Constacyclic codes of length \(8p^s\) over \(\mathbb{F}_{p^m} + u\mathbb{F}_{p^m}\), On \(\sigma \)-self-orthogonal constacyclic codes over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}\), An efficient method to construct self-dual cyclic codes of length \(p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m} \), NEGACYCLIC CODES OF LENGTH 8p s OVER F p m + uF p m, Skew constacyclic codes of lengths \(p^s\) and \(2p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m} \), Constacyclic codes over \(F_q[u_1, u_2, \cdots, u_k/\langle u_i^3-u_i, u_iu_j - u_ju_i\rangle\) and their applications of constructing quantum codes], A characterization of optimal constacyclic locally repairable codes, On Cyclic and Negacyclic Codes of Length 8p<sup>s</sup> Over Fp<sup>m</sup> + uFp<sup>m</sup>, On self-dual skew cyclic codes of length \(p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m} \), Classification of self-dual cyclic codes over the chain ring \(\mathbb Z_p[u/\langle u^3 \rangle \)], Self-reciprocal and self-conjugate-reciprocal irreducible factors of \(x^n - \lambda\) and their applications, Classes of constacyclic codes of length \(p^s\) over the ring \(\mathbb F_{p^m}+u \mathbb F_{p^m}+v\mathbb F_{p^m}+uv\mathbb F_{p^m}\), Explicit constructions of cyclic and negacyclic codes of length 3ps over đ˝pm + uđ˝pm
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Repeated-root constacyclic codes of prime power lengths over finite chain rings
- Negacyclic codes of length \(2p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
- Constacyclic codes of length \(p^s\) over \(\mathbb F_{p^m} + u\mathbb F_{p^m}\)
- A note on cyclic codes over \(\mathrm{GR}(p^{2},m)\) of length \(p^{k}\)
- Constacyclic codes over finite fields
- Constacyclic codes of length \(2p^{s}\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
- Cyclic codes over \(\text{GR}(p^2,m)\) of length \(p^k\)
- A note on cyclic codes over GR\((p^2,m)\) of length \(p^k\)
- Type II codes over \(\mathbb F_2+ u\mathbb F_2\) and applications to Hermitian modular forms
- On the structure of linear and cyclic codes over a finite chain ring
- Cyclic codes over \(\mathbb{Z}_{4}\) of oddly even length.
- On the decomposition of self-dual codes over \(\mathbb F_2 + u\mathbb F_2\) with an automorphism of odd prime order
- On constacyclic codes over finite chain rings
- Cyclic codes over \(\mathbb Z_4\) of even length
- On the generators of Z/sub 4/ cyclic codes of length 2/sup e/
- Negacyclic Codes of Length<tex>$2^s$</tex>Over Galois Rings
- Cyclic and Negacyclic Codes Over Finite Chain Rings
- On cyclic MDS codes of length q over GF(q) (Corresp.)
- A linear construction for certain Kerdock and Preparata codes
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- A note on the q-ary image of a q/sup m/-ary repeated-root cyclic code
- Fundamentals of Error-Correcting Codes
- Decoding of cyclic codes over F/sub 2/+uF/sub 2/
- Weight distributions of cyclic self-dual codes
- Cyclic codes and self-dual codes over F/sub 2/+uF/sub 2/
- On generalizations of repeated-root cyclic codes
- Constacyclic Codes of Length $2^s$ Over Galois Extension Rings of ${\BBF}_{2}+u{\BBF}_2$
- On Self-Dual Cyclic Codes Over Finite Fields
- Polynomial weights and code constructions
- On repeated-root cyclic codes
- Repeated-root cyclic codes