Negacyclic codes of length \(2p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)

From MaRDI portal
Revision as of 04:44, 30 January 2024 by Import240129110155 (talk | contribs) (Created automatically from import240129110155)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:473090

DOI10.1016/j.ffa.2014.09.003zbMath1320.94099OpenAlexW2328380509MaRDI QIDQ473090

Shixin Zhu, Liqi Wang, Hai Quang Dinh

Publication date: 21 November 2014

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ffa.2014.09.003




Related Items (34)

Type 2 constacyclic codes over \(\mathbb{F}_{2^m} [u \slash \langle u^3 \rangle\) of oddly even length] ⋮ A class of repeated-root constacyclic codes over \(\mathbb{F}_{p^m} [u / \langle u^e \rangle\) of type 2] ⋮ RT distances and Hamming distances of constacyclic codes of length \(8p^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}\)Self-dual constacyclic codes of length \(2^s\) over the ring \(\mathbb{F}_{2^m}[u,v/\langle u^2, v^2, uv-vu \rangle \)] ⋮ A class of constacyclic codes over \({\mathbb{F}}_{p^m}[u/\langle u^2\rangle\)] ⋮ Repeated-root constacyclic codes of arbitrary lengths over the Galois ring GR(p2,m)Constacyclic codes of length \(8p^s\) over \(\mathbb{F}_{p^m} + u\mathbb{F}_{p^m}\)An explicit expression for Euclidean self-dual cyclic codes over \(\mathbb{F}_{2^m} + u \mathbb{F}_{2^m}\) of length \(2^s\)An efficient method to construct self-dual cyclic codes of length \(p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m} \)A note on self-dual negacyclic codes of length \(p^s\) over \(\mathbb{F}_{p^k} + u\mathbb{F}_{p^k}\)Cyclic and negacyclic codes of length 4ps over 𝔽pm + u𝔽pmOn constacyclic codes of length \(p^s\) over \(\mathbb{F}_{p^m} [ u , v \slash \langle u^2 , v^2 , u v - v u \rangle \)] ⋮ NEGACYCLIC CODES OF LENGTH 8p s OVER F p m + uF p mOn self-dual constacyclic codes of length \(p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)An explicit representation and enumeration for self-dual cyclic codes over \(\mathbb{F}_{2^m}+u\mathbb{F}_{2^m}\) of length \(2^s\)Constacyclic codes of length \(2p^{s}\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)All \(\alpha+u\beta\)-constacyclic codes of length \(np^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}\)Negacyclic codes of length \(4 p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\) and their dualsMDS symbol-pair repeated-root constacylic codes of prime power lengths over \(\mathbb{F}_q+ u\mathbb{F}_q + u^2\mathbb{F}_q\)On a class of constacyclic codes of length 4ps over 𝔽pm + u𝔽pmOn (α + uβ)-constacyclic codes of length 4ps over 𝔽pm + u𝔽pm∗On Cyclic and Negacyclic Codes of Length 8p<sup>s</sup> Over Fp<sup>m</sup> + uFp<sup>m</sup>A class of linear codes of length 2 over finite chain ringsCyclic codes and \(\lambda_1 + \lambda_2 u + \lambda_3 v + \lambda_4 u v\)-constacyclic codes over \(\mathbb{F}_p + u \mathbb{F}_p + v \mathbb{F}_p + u v \mathbb{F}_p\)On constacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m} +u\mathbb{F}_{p^m}\)Repeated-root constacyclic codes over \(\mathbb{F}_2 + u \mathbb{F}_2 + v \mathbb{F}_2 + u v \mathbb{F}_2\)On constacyclic codes over \(Z_{p_1 p_2 \cdots p_t}\)Classification of self-dual cyclic codes over the chain ring \(\mathbb Z_p[u/\langle u^3 \rangle \)] ⋮ RT distance and weight distributions of Type 1 constacyclic codes of length 4ps over Fpm[u] ⋮ Complete classification of repeated-root \(\sigma\)-constacyclic codes of prime power length over \(\mathbb{F}_{p^m} [ u \slash \langle u^3 \rangle \)] ⋮ Constacyclic codes of length \(np^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}\)Repeated-root constacyclic codes of length \(2p^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}+u^2\mathbb{F}_{p^m} \)Construction and enumeration for self-dual cyclic codes of even length over \(\mathbb{F}_{2^m} + u \mathbb{F}_{2^m} \)Unnamed Item



Cites Work




This page was built for publication: Negacyclic codes of length \(2p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)