Pages that link to "Item:Q1931511"

The following pages link to Polycyclic codes over Galois rings with applications to repeated-root constacyclic codes (Q1931511):

Displaying 32 items.

• On a class of repeated-root monomial-like abelian codes (Q307909) (← links)
• The Hamming distances of repeated-root cyclic codes of length \(5 p^s\) (Q777357) (← links)
• Hamming distance of repeated-root constacyclic codes of length \(2p^s\) over \({\mathbb{F}}_{p^m}+u{\mathbb{F}}_{p^m} \) (Q780367) (← links)
• Codes over affine algebras with a finite commutative chain coefficient ring (Q1679699) (← links)
• On the Hamming distances of repeated-root constacyclic codes of length \(4p^s\) (Q1732780) (← links)
• Additive cyclic codes over finite commutative chain rings (Q1752658) (← links)
• Polycyclic codes as invariant subspaces (Q1994978) (← links)
• Hamming distances of constacyclic codes of length \(3p^s\) and optimal codes with respect to the Griesmer and Singleton bounds (Q1995224) (← links)
• On the structure of 1-generator quasi-polycyclic codes over finite chain rings (Q2089275) (← links)
• Quantum MDS and synchronizable codes from cyclic and negacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m}\) (Q2099600) (← links)
• On \(\mathbb{Z}_2\mathbb{Z}_4\)-additive polycyclic codes and their Gray images (Q2109382) (← links)
• \((f, \sigma, \delta)\)-skew polycyclic codes and their applications to quantum codes (Q2114020) (← links)
• A transform approach to polycyclic and serial codes over rings (Q2123309) (← links)
• On cyclic codes over Galois rings (Q2181253) (← links)
• Do non-free LCD codes over finite commutative Frobenius rings exist? (Q2182059) (← links)
• On polycyclic codes over a finite chain ring (Q2194507) (← links)
• On the symbol-pair distances of repeated-root constacyclic codes of length \(2 p^s\) (Q2324496) (← links)
• Lee weights of cyclic self-dual codes over Galois rings of characteristic \(p^2\) (Q2396754) (← links)
• Multivariable codes in principal ideal polynomial quotient rings with applications to additive modular bivariate codes over \(\mathbb{F}_4\) (Q2403979) (← links)
• A note on: ``Hamming distance of repeated-root constacyclic codes of length \(2p^s\) over \({\mathbb{F}}_{p^m}+u{\mathbb{F}}_{p^m}\)'' (Q2689910) (← links)
• Polycyclic codes over \(\mathbb{F}_{p^m} [u] / \langle u^2 \rangle \): classification, Hamming distance, and annihilators (Q2701058) (← links)
• Cyclic Codes over Galois Rings (Q2795950) (← links)
• Optimal b-symbol constacyclic codes with respect to the Singleton bound (Q5132285) (← links)
• (Q6039754) (← links)
• On the structure of repeated-root polycyclic codes over local rings (Q6056443) (← links)
• On symbol-pair distances of repeated-root constacyclic codes of length \(2p^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}\) and MDS symbol-pair codes (Q6056621) (← 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)
• A characterization of optimal constacyclic locally repairable codes (Q6204325) (← links)
• Hamming distances of constacyclic codes of length \(7p^s\) over \(\mathbb{F}_{p^m}\) (Q6495858) (← links)
• On the polycyclic codes over \(\mathbb{F}_q +u\mathbb{F}_q\) (Q6556573) (← links)
• On constacyclic codes of length \(9 p^s\) over \(\mathbb{F}_{p^m}\) and their optimal codes (Q6580182) (← links)