Negacyclic codes of prime power length over the finite non-commutative chain ring F_p^m[u,] u^2

DOI10.1142/S1793830921500919zbMATH Open1492.94212OpenAlexW3129407636MaRDI QIDQ5063263FDOQ5063263

Authors: Teeramet Inchaisri, Jirayu Phuto, Chakkrid Klin-eam 

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

Recommendations

• Negacyclic codes of length \(4 p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\) and their duals
• Negacyclic codes of length \(2p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
• Negacyclic codes of length \(8p^s\) over \(F_{p^m} + uF_{p^m}\)
• scientific article; zbMATH DE number 6452928
• Cyclic and Negacyclic Codes Over Finite Chain Rings

zbMATH Keywords

non-commutative ringsskew polynomialsrepeated-root codesleft negacyclic codes

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Cyclic codes (94B15)

Cites Work

• Polynomial Codes Over Certain Finite Fields
• Negacyclic Codes of Length<tex>$2^s$</tex>Over Galois Rings
• Cyclic and Negacyclic Codes Over Finite Chain Rings
• Title not available (Why is that?)
• The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
• Constacyclic Codes of Length $2^s$ Over Galois Extension Rings of ${\BBF}_{2}+u{\BBF}_2$
• Title not available (Why is that?)
• On repeated-root cyclic codes
• Repeated-root cyclic codes
• Constacyclic codes of length \(p^s\) over \(\mathbb F_{p^m} + u\mathbb F_{p^m}\)
• Cyclic codes over \(\mathbb{Z}_{4}\) of oddly even length.
• Euclidean self-dual codes over non-commutative Frobenius rings
• Title not available (Why is that?)
• Negacyclic and cyclic codes over Z/sub 4/
• Negacyclic codes over Z/sub 4/ of even length
• On the generators of Z/sub 4/ cyclic codes of length 2/sup e/
• 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
• Constacyclic codes of length \(2p^{s}\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
• Title not available (Why is that?)
• On the complexity of decoding Reed-Solomon codes (Corresp.)
• Algebraic Coding Theory Over Finite Commutative Rings
• Cyclic codes over a non-commutative finite chain ring
• 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 \)
• Repeated-root constacyclic codes of arbitrary lengths over the Galois ring GR(p2,m)
• NEGACYCLIC CODES OF LENGTH 8p s OVER F p m + uF p m
• On Generalized Reed–Solomon Codes Over Commutative and Noncommutative Rings

Cited In (2)

• 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} \)
• Title not available (Why is that?)

This page was built for publication: Negacyclic 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 Q5063263)