On constacyclic codes of length 9 p^s over F_p^m and their optimal codes

DOI10.1142/S0219498825500768MaRDI QIDQ6580182FDOQ6580182

Authors: Hai Quang Dinh, Hieu V. Ha, Nhan T. Nguyen, Nghia Tran 

Publication date: 29 July 2024

Published in: Journal of Algebra and its Applications (Search for Journal in Brave)

Recommendations

• Repeated-root constacyclic codes of length \(k^s l^m p^n\) over finite fields
• Repeated-root constacyclic codes of length \(\ell^{t}p^{s}\) and their dual codes
• Hamming distances of constacyclic codes of length \(3p^s\) and optimal codes with respect to the Griesmer and Singleton bounds
• On Hamming distance distributions of repeated-root constacyclic codes of length \(3p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
• On the Hamming distances of repeated-root constacyclic codes of length \(4p^s\)

zbMATH Keywords

Hamming distancecyclic codeMDS codenear-MDS codeAMDS coderepeated-root constacyclic code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cyclic codes (94B15)

Cites Work

• Structure of repeated-root constacyclic codes of length \(3p^s\) and their duals
• On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions
• A note on the q-ary image of a q/sup m/-ary repeated-root cyclic code
• Fundamentals of Error-Correcting Codes
• Weight distributions of cyclic self-dual codes
• Polynomial weights and code constructions
• On repeated-root cyclic codes
• Repeated-root cyclic codes
• Repeated-root constacyclic codes of length
• Title not available (Why is that?)
• Repeated-root constacyclic codes of length \(2 \ell^m p^n\)
• On repeated-root constacyclic codes of length \(4p^s\)
• Repeated-root constacyclic codes of length \(4\ell^{m}p^{n}\)
• Polycyclic codes over Galois rings with applications to repeated-root constacyclic codes
• Repeated-root constacyclic codes of length \(3lp^s\) and their dual codes
• The minimum Hamming distance of cyclic codes of length \(2p^s\)
• On the Hamming distances of repeated-root constacyclic codes of length \(4p^s\)
• Title not available (Why is that?)
• Hamming distances of constacyclic codes of length \(3p^s\) and optimal codes with respect to the Griesmer and Singleton bounds

This page was built for publication: On constacyclic codes of length \(9 p^s\) over \(\mathbb{F}_{p^m}\) and their optimal codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6580182)