Hamming distances of repeated-root constacyclic codes of prime power lengths over F₅^m+uF₅^m

zbMATH Open1423.94159MaRDI QIDQ5236396FDOQ5236396

Authors: Nguyen Trong Bac 

Publication date: 15 October 2019

Recommendations

• Hamming distance of repeated-root constacyclic codes of length \(2p^s\) over \({\mathbb{F}}_{p^m}+u{\mathbb{F}}_{p^m} \)
• Some classes of repeated-root constacyclic codes over \(\mathbb F_{p^m}+u\mathbb F_{p^m}+u^2\mathbb F_{p^m}\)
• On the Hamming distances of repeated-root constacyclic codes of length \(4p^s\)
• Repeated-root constacyclic codes of prime power length over \(\frac{\mathbb{F}_{p^m} [u]}{\langle u^a \rangle}\) and their duals
• 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}\)

zbMATH Keywords

Hamming distancedual codesMDS codesnegacyclic codesrepeated-root codessymbol-pair distance

Mathematics Subject Classification ID

Cyclic codes (94B15)

Cited In (5)

• The Hamming distances of repeated-root cyclic codes of length \(5 p^s\)
• Hamming distance of repeated-root constacyclic codes of length \(2p^s\) over \({\mathbb{F}}_{p^m}+u{\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}\)
• A note on: ``Hamming distance of repeated-root constacyclic codes of length \(2p^s\) over \({\mathbb{F}}_{p^m}+u{\mathbb{F}}_{p^m}\)
• Hamming distances of constacyclic codes of length \(6p^s\) over \(\frac{\mathbb{F}_{p^m}[u]}{\langle u^2\rangle}\)

This page was built for publication: Hamming distances of repeated-root constacyclic codes of prime power lengths over \(\mathbb{F}_{5^m}+u\mathbb{F}_{5^m}\)

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