Repeated-root constacyclic codes of length \(\ell p^s\) and their duals

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

Publication:406323

DOI10.1016/J.DAM.2014.05.046zbMath1325.94156OpenAlexW2061268162MaRDI QIDQ406323

Hai Quang Dinh, Bocong Chen, Hong-wei Liu

Publication date: 8 September 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2014.05.046




Related Items (34)

Repeated-root constacyclic codes of length \(n l p^s\)Repeated-root constacyclic codes of length \(4\ell^{m}p^{n}\)Recent progress on weight distributions of cyclic codes over finite fieldsConstacyclic codes of length \(kl^{m}p^{n}\) over a finite fieldRepeated-root constacyclic codes of length \(3lp^s\) and their dual codesEnumeration of self-dual cyclic codes of some specific lengths over finite fieldsRepeated-root constacyclic codes of length \(3 \ell^m p^s\)Quantum MDS and synchronizable codes from cyclic codes of length \(5p^s\) over \(\mathbb{F}_{p^m}\)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}\)] ⋮ Optimal constructions of quantum and synchronizable codes from repeated-root cyclic codes of length \(3p^s\)Complete classification of cyclic codes of length 3ps over 𝔽pm + u𝔽pm + u2𝔽pmRepeated-root two-dimensional constacyclic codes of length \(2p^s\cdot 2^k\)Repeated-root constacyclic codes of length \(6l^mp^n\)A characterization of optimal constacyclic locally repairable codesOptimal b-symbol constacyclic codes with respect to the Singleton boundOn the Hamming distances of repeated-root constacyclic codes of length \(4p^s\)Unnamed ItemSelf-dual and self-orthogonal negacyclic codes of length \(2^m p^n\) over a finite fieldPrimitive idempotents of irreducible cyclic codes and self-dual cyclic codes over Galois ringsHamming distances of constacyclic codes of length \(3p^s\) and optimal codes with respect to the Griesmer and Singleton boundsRepeated-root constacyclic codes of length \(kl^{a}p^{b}\) over a finite fieldRepeated-root constacyclic codes of length \(2 \ell^m p^n\)Unnamed ItemConstructing MDS Galois self-dual constacyclic codes over finite fieldsRepeated-root constacyclic codes of length \(6lp^s\)On the \(b\)-distance of repeated-root constacyclic codes of prime power lengthsSelf-reciprocal and self-conjugate-reciprocal irreducible factors of \(x^n - \lambda\) and their applicationsThe minimum Hamming distances of repeated-root cyclic codes of length \(6p^s\) and their MDS codesRepeated-root constacyclic codes of length \(k\ell p^s\)Structure of repeated-root constacyclic codes of length 8ℓmpnThe Hamming distances of repeated-root cyclic codes of length \(5 p^s\)Structure of some classes of repeated-root constacyclic codes of length \(2^{\mathfrak{K}} \ell^m p^n\)Quantum MDS and synchronizable codes from cyclic and negacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m}\)Two new families of quantum synchronizable codes




Cites Work




This page was built for publication: Repeated-root constacyclic codes of length \(\ell p^s\) and their duals