Negacyclic codes of prime power length over the finite non-commutative chain ring đ˝pm[u,đ] ău2ă
From MaRDI portal
Publication:5063263
DOI10.1142/S1793830921500919zbMath1492.94212OpenAlexW3129407636MaRDI QIDQ5063263
Chakkrid Klin-eam, Jirayu Phuto, Teeramet Inchaisri
Publication date: 17 March 2022
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830921500919
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Cyclic codes (94B15)
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} \)]
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Euclidean self-dual codes over non-commutative Frobenius rings
- Constacyclic codes of length \(p^s\) over \(\mathbb F_{p^m} + u\mathbb F_{p^m}\)
- Constacyclic codes of length \(2p^{s}\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
- Cyclic codes over a non-commutative finite chain ring
- Cyclic codes over \(\mathbb{Z}_{4}\) of oddly even length.
- 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 \)]
- A family of constacyclic codes over \(\mathbb F_{2} + u\mathbb F_{2} + v\mathbb F_{2} + uv\mathbb F_{2}\)
- Repeated-root cyclic and negacyclic codes over a finite chain ring
- Polynomial Codes Over Certain Finite Fields
- 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 the complexity of decoding Reed-Solomon codes (Corresp.)
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- Negacyclic and cyclic codes over Z/sub 4/
- Repeated-root constacyclic codes of arbitrary lengths over the Galois ring GR(p2,m)
- Negacyclic codes over Z/sub 4/ of even length
- Constacyclic Codes of Length $2^s$ Over Galois Extension Rings of ${\BBF}_{2}+u{\BBF}_2$
- NEGACYCLIC CODES OF LENGTH 8p s OVER F p m + uF p m
- Algebraic Coding Theory Over Finite Commutative Rings
- On Generalized ReedâSolomon Codes Over Commutative and Noncommutative Rings
- On repeated-root cyclic codes
- Repeated-root cyclic codes
