Pages that link to "Item:Q1995224"

The following pages link to Hamming distances of constacyclic codes of length \(3p^s\) and optimal codes with respect to the Griesmer and Singleton bounds (Q1995224):

Displaying 7 items.

• Hamming distance of repeated-root constacyclic codes of length \(2p^s\) over \({\mathbb{F}}_{p^m}+u{\mathbb{F}}_{p^m} \) (Q780367) (← links)
• Hartmann-Tzeng bound and skew cyclic codes of designed Hamming distance (Q1696750) (← links)
• On the Hamming distances of repeated-root constacyclic codes of length \(4p^s\) (Q1732780) (← links)
• The minimum Hamming distances of repeated-root cyclic codes of length \(6p^s\) and their MDS codes (Q2053125) (← links)
• On Hamming distance distributions of repeated-root constacyclic codes of length \(3p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\) (Q6080544) (← links)
• Hamming distances of constacyclic codes of length \(7p^s\) over \(\mathbb{F}_{p^m}\) (Q6495858) (← links)
• On constacyclic codes of length \(9 p^s\) over \(\mathbb{F}_{p^m}\) and their optimal codes (Q6580182) (← links)