Pages that link to "Item:Q3656816"

The following pages link to The Minimum Hamming Distance of Cyclic Codes of Length 2p s (Q3656816):

Displaying 13 items.

• Repeated-root constacyclic codes of length \(3lp^s\) and their dual codes (Q324296) (← links)
• Hamming distance of repeated-root constacyclic codes of length \(2p^s\) over \({\mathbb{F}}_{p^m}+u{\mathbb{F}}_{p^m} \) (Q780367) (← links)
• On the Hamming distances of repeated-root constacyclic codes of length \(4p^s\) (Q1732780) (← links)
• Hamming distances of constacyclic codes of length \(3p^s\) and optimal codes with respect to the Griesmer and Singleton bounds (Q1995224) (← links)
• The minimum Hamming distances of repeated-root cyclic codes of length \(6p^s\) and their MDS codes (Q2053125) (← links)
• Quantum MDS and synchronizable codes from cyclic and negacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m}\) (Q2099600) (← links)
• Two new families of quantum synchronizable codes (Q2110957) (← links)
• On non-binary quantum repeated-root cyclic codes (Q2925839) (← links)
• Quantum MDS and synchronizable codes from cyclic codes of length \(5p^s\) over \(\mathbb{F}_{p^m}\) (Q6080427) (← links)
• Optimal constructions of quantum and synchronizable codes from repeated-root cyclic codes of length \(3p^s\) (Q6107760) (← 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)
• New quantum codes and entanglement-assisted quantum codes from repeated-root cyclic codes of length \(2^rp^s\) (Q6629257) (← links)