On constacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m} +u\mathbb{F}_{p^m}\)

DOI10.1016/j.disc.2016.11.014zbMath1372.94460OpenAlexW2560006274MaRDI QIDQ507515

Songsak Sriboonchitta, Sompong Dhompongsa, Hai Quang Dinh

Publication date: 6 February 2017

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

Full work available at URL: https://doi.org/10.1016/j.disc.2016.11.014

zbMATH Keywords

codes over ringsconstacyclic codesdual codeschain ringsrepeated-root codes

Mathematics Subject Classification ID

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

Related Items

Type 2 constacyclic codes over \(\mathbb{F}_{2^m} [u \slash \langle u^3 \rangle\) of oddly even length] ⋮ A class of repeated-root constacyclic codes over \(\mathbb{F}_{p^m} [u / \langle u^e \rangle\) of type 2] ⋮ RT distances and Hamming distances of constacyclic codes of length \(8p^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}\) ⋮ Self-dual constacyclic codes of length \(2^s\) over the ring \(\mathbb{F}_{2^m}[u,v/\langle u^2, v^2, uv-vu \rangle \)] ⋮ A class of constacyclic codes over \({\mathbb{F}}_{p^m}[u/\langle u^2\rangle\)] ⋮ Constacyclic codes of length \(8p^s\) over \(\mathbb{F}_{p^m} + u\mathbb{F}_{p^m}\) ⋮ An explicit expression for Euclidean self-dual cyclic codes over \(\mathbb{F}_{2^m} + u \mathbb{F}_{2^m}\) of length \(2^s\) ⋮ An efficient method to construct self-dual cyclic codes of length \(p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m} \) ⋮ Complete classification for simple root cyclic codes over the local ring \(\mathbb{Z}_4[v/\langle v^2+2v\rangle \)] ⋮ Cyclic and negacyclic codes of length 4ps over 𝔽pm + u𝔽pm ⋮ 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 \)] ⋮ NEGACYCLIC CODES OF LENGTH 8p s OVER F p m + uF p m ⋮ On symbol-pair distances of repeated-root constacyclic codes of length \(2p^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}\) and MDS symbol-pair codes ⋮ Quantum MDS and synchronizable codes from cyclic codes of length \(5p^s\) over \(\mathbb{F}_{p^m}\) ⋮ On Hamming distance distributions of repeated-root constacyclic codes of length \(3p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\) ⋮ An explicit representation and enumeration for self-dual cyclic codes over \(\mathbb{F}_{2^m}+u\mathbb{F}_{2^m}\) of length \(2^s\) ⋮ Optimal constructions of quantum and synchronizable codes from repeated-root cyclic codes of length \(3p^s\) ⋮ Skew constacyclic codes of lengths \(p^s\) and \(2p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m} \) ⋮ Negacyclic codes of length \(4 p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\) and their duals ⋮ MDS symbol-pair repeated-root constacylic codes of prime power lengths over \(\mathbb{F}_q+ u\mathbb{F}_q + u^2\mathbb{F}_q\) ⋮ On a class of constacyclic codes of length 4ps over 𝔽pm + u𝔽pm ⋮ On (α + uβ)-constacyclic codes of length 4ps over 𝔽pm + u𝔽pm∗ ⋮ On Cyclic and Negacyclic Codes of Length 8p^s Over Fp^m + uFp^m ⋮ A class of linear codes of length 2 over finite chain rings ⋮ RT distance and weight distributions of Type 1 constacyclic codes of length 4ps over Fpm[u] ⋮ Complete classification of repeated-root \(\sigma\)-constacyclic codes of prime power length over \(\mathbb{F}_{p^m} [ u \slash \langle u^3 \rangle \)] ⋮ Constacyclic codes of length \(np^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}\) ⋮ Construction and enumeration for self-dual cyclic codes of even length over \(\mathbb{F}_{2^m} + u \mathbb{F}_{2^m} \) ⋮ 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}\) ⋮ Explicit constructions of cyclic and negacyclic codes of length 3ps over 𝔽pm + u𝔽pm ⋮ Construction of optimal codes from a class of constacyclic codes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Negacyclic 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}\)
• Repeated-root constacyclic codes of length
• Constacyclic codes of length \(2p^{s}\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
• Type II codes over \(\mathbb F_2+ u\mathbb F_2\) and applications to Hermitian modular forms
• On the structure of linear and cyclic codes over a finite chain ring
• Cyclic codes over \(\mathbb{Z}_{4}\) of oddly even length.
• Structure of repeated-root constacyclic codes of length \(3p^s\) and their duals
• On the decomposition of self-dual codes over \(\mathbb F_2 + u\mathbb F_2\) with an automorphism of odd prime order
• Repeated-root cyclic and negacyclic codes over a finite chain ring
• Cyclic codes over \(\mathbb Z_4\) of even length
• ON REPEATED-ROOT CONSTACYCLIC CODES OF LENGTH 4p^s
• 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 cyclic MDS codes of length q over GF(q) (Corresp.)
• A linear construction for certain Kerdock and Preparata codes
• The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
• A note on the q-ary image of a q/sup m/-ary repeated-root cyclic code
• Fundamentals of Error-Correcting Codes
• Decoding of cyclic codes over F/sub 2/+uF/sub 2/
• Weight distributions of cyclic self-dual codes
• Cyclic codes and self-dual codes over F/sub 2/+uF/sub 2/
• On generalizations of repeated-root cyclic codes
• 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