Pages that link to "Item:Q2853419"

The following pages link to ON REPEATED-ROOT CONSTACYCLIC CODES OF LENGTH 4p^s (Q2853419):

Displaying 29 items.

• Repeated-root constacyclic codes of length \(4\ell^{m}p^{n}\) (Q285476) (← links)
• On constacyclic codes over finite fields (Q301647) (← links)
• A class of constacyclic codes over a finite field. II (Q308341) (← links)
• Self-dual and self-orthogonal negacyclic codes of length \(2^m p^n\) over a finite field (Q488282) (← links)
• On constacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m} +u\mathbb{F}_{p^m}\) (Q507515) (← links)
• Hamming distance of repeated-root constacyclic codes of length \(2p^s\) over \({\mathbb{F}}_{p^m}+u{\mathbb{F}}_{p^m} \) (Q780367) (← links)
• Enumeration of self-dual and self-orthogonal negacyclic codes over finite fields (Q895000) (← links)
• On MDS linear complementary dual codes and entanglement-assisted quantum codes (Q1647570) (← links)
• Galois LCD codes over finite fields (Q1679715) (← links)
• Repeated-root two-dimensional constacyclic codes of length \(2p^s\cdot 2^k\) (Q1696752) (← links)
• On the Hamming distances of repeated-root constacyclic codes of length \(4p^s\) (Q1732780) (← links)
• On complementary dual quasi-twisted codes (Q1743356) (← links)
• Multi-twisted codes over finite fields and their dual codes (Q1747927) (← links)
• Hamming distances of constacyclic codes of length \(3p^s\) and optimal codes with respect to the Griesmer and Singleton bounds (Q1995224) (← links)
• 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}\) (Q2053264) (← links)
• RT distances and Hamming distances of constacyclic codes of length \(8p^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}\) (Q2140794) (← links)
• MDS constacyclic codes of prime power lengths over finite fields and construction of quantum MDS codes (Q2207991) (← links)
• New entanglement-assisted quantum MDS codes with maximal entanglement (Q2241009) (← links)
• On the \(b\)-distance of repeated-root constacyclic codes of prime power lengths (Q2297733) (← links)
• On the symbol-pair distances of repeated-root constacyclic codes of length \(2 p^s\) (Q2324496) (← links)
• Structure of some classes of repeated-root constacyclic codes of length \(2^{\mathfrak{K}} \ell^m p^n\) (Q2329194) (← links)
• LCD codes over finite chain rings (Q2348159) (← links)
• Skew constacyclic codes over finite commutative semi-simple rings (Q4968650) (← links)
• (Q5082028) (← links)
• Optimal b-symbol constacyclic codes with respect to the Singleton bound (Q5132285) (← links)
• On (α + uβ)-constacyclic codes of length 4ps over 𝔽pm + u𝔽pm∗ (Q5377474) (← links)
• On the classification of ideals over \(R[X]/\langle f(X)^{p^s}\rangle\) when \(R=\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}+\cdots+u^n\mathbb{F}_{p^m}\) (Q6107455) (← links)
• Complete classification of cyclic codes of length 3ps over 𝔽pm + u𝔽pm + u2𝔽pm (Q6132237) (← links)
• Hamming distances of constacyclic codes of length \(7p^s\) over \(\mathbb{F}_{p^m}\) (Q6495858) (← links)