Duality of constacyclic codes of prime power length over the finite non-commutative chain ring F_p^m [ u , ] u^2
From MaRDI portal
Publication:2124648
Recommendations
- On self-dual constacyclic codes of length \(p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
- Complete classification of \((\delta + \alpha u^2)\)-constacyclic codes of length \(p^k\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m} + u^2 \mathbb{F}_{p^m}\)
- On \((\alpha + u \beta)\)-constacyclic codes of length \(4 p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}^\ast\)
- On constacyclic codes over finite chain rings
- Repeated-root constacyclic codes of prime power length over \(\frac{\mathbb{F}_{p^m} [u]}{\langle u^a \rangle}\) and their duals
Cites work
- scientific article; zbMATH DE number 3460471 (Why is no real title available?)
- A New Algorithm for Decoding Reed-Solomon Codes
- A classification of self-orthogonal codes over GF(2)
- Application of Constacyclic Codes to Quantum MDS Codes
- Constacyclic Codes and Some New Quantum MDS Codes
- Constacyclic Codes of Length $2^s$ Over Galois Extension Rings of ${\BBF}_{2}+u{\BBF}_2$
- Constacyclic 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}\)
- Cyclic codes over \(M_2(\mathbb F_2)\)
- Cyclic codes over a non-commutative finite chain ring
- Euclidean self-dual codes over non-commutative Frobenius rings
- Linear codes with complementary duals
- Negacyclic codes of length \(8p^s\) over \(F_{p^m} + uF_{p^m}\)
- Negacyclic codes of prime power length over the finite non-commutative chain ring \(\frac{\mathbb{F}_{p^m}[u,\theta]}{\langle u^2\rangle}\)
- On Generalized Reed–Solomon Codes Over Commutative and Noncommutative Rings
- On constacyclic codes of length \(p^s\) over \(\mathbb{F}_{p^m} [ u , v ] \slash \langle u^2 , v^2 , u v - v u \rangle \)
- On repeated-root cyclic codes
- On self-dual constacyclic codes of length \(p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
- On the complexity of decoding Reed-Solomon codes (Corresp.)
- Polynomial Codes Over Certain Finite Fields
- Quantum error correction via codes over GF(4)
- Repeated-root constacyclic codes of prime power length over \(\frac{\mathbb{F}_{p^m} [u]}{\langle u^a \rangle}\) and their duals
- Repeated-root cyclic codes
- Semisimple cyclic and Abelian codes. II
- Some classes of repeated-root constacyclic codes over \(\mathbb F_{p^m}+u\mathbb F_{p^m}+u^2\mathbb F_{p^m}\)
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
Cited in
(2)
This page was built for publication: 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} \)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2124648)
