ON REPEATED-ROOT CONSTACYCLIC CODES OF LENGTH 4ps
From MaRDI portal
Publication:2853419
DOI10.1142/S1793557113500204zbMath1283.94128MaRDI QIDQ2853419
Publication date: 21 October 2013
Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)
Related Items
Repeated-root constacyclic codes of length \(4\ell^{m}p^{n}\) ⋮ On constacyclic codes over finite fields ⋮ RT distances and Hamming distances of constacyclic codes of length \(8p^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}\) ⋮ A class of constacyclic codes over a finite field. II ⋮ On MDS linear complementary dual codes and entanglement-assisted quantum codes ⋮ Galois LCD codes over finite fields ⋮ Enumeration of self-dual and self-orthogonal negacyclic codes over finite fields ⋮ 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}\)] ⋮ Complete classification of cyclic codes of length 3ps over 𝔽pm + u𝔽pm + u2𝔽pm ⋮ Repeated-root two-dimensional constacyclic codes of length \(2p^s\cdot 2^k\) ⋮ Skew constacyclic codes over finite commutative semi-simple rings ⋮ MDS constacyclic codes of prime power lengths over finite fields and construction of quantum MDS codes ⋮ On (α + uβ)-constacyclic codes of length 4ps over 𝔽pm + u𝔽pm∗ ⋮ Optimal b-symbol constacyclic codes with respect to the Singleton bound ⋮ On the Hamming distances of repeated-root constacyclic codes of length \(4p^s\) ⋮ Self-dual and self-orthogonal negacyclic codes of length \(2^m p^n\) over a finite field ⋮ On complementary dual quasi-twisted codes ⋮ New entanglement-assisted quantum MDS codes with maximal entanglement ⋮ On constacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m} +u\mathbb{F}_{p^m}\) ⋮ Multi-twisted codes over finite fields and their dual codes ⋮ Hamming distances of constacyclic codes of length \(3p^s\) and optimal codes with respect to the Griesmer and Singleton bounds ⋮ Unnamed Item ⋮ On the \(b\)-distance of repeated-root constacyclic codes of prime power lengths ⋮ On Hamming and \(b\)-symbol distance distributions of repeated-root constacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m}+u \mathbb{F}_{p^m}\) ⋮ On the symbol-pair distances of repeated-root constacyclic codes of length \(2 p^s\) ⋮ Hamming distance of repeated-root constacyclic codes of length \(2p^s\) over \({\mathbb{F}}_{p^m}+u{\mathbb{F}}_{p^m} \) ⋮ Structure of some classes of repeated-root constacyclic codes of length \(2^{\mathfrak{K}} \ell^m p^n\) ⋮ LCD codes over finite chain rings
Cites Work
- Constacyclic codes of length \(p^s\) over \(\mathbb F_{p^m} + u\mathbb F_{p^m}\)
- Repeated-root constacyclic codes of length
- On complementary-dual quasi-cyclic codes
- Linear codes with complementary duals
- The condition for a cyclic code to have a complementary dual
- Linear codes with complementary duals meet the Gilbert-Varshamov bound
- On cyclic MDS codes of length q over GF(q) (Corresp.)
- Constacyclic Codes of Length $2^s$ Over Galois Extension Rings of ${\BBF}_{2}+u{\BBF}_2$
- Polynomial weights and code constructions
- On repeated-root cyclic codes
- Repeated-root cyclic codes
