On constacyclic codes of length 10p^s over F_p^m and their optimal codes
From MaRDI portal
Publication:7356966
Cites work
- Error Correcting Codes in Quantum Theory
- Fundamentals of Error-Correcting Codes
- Hamming distances of constacyclic codes of length 3p^s and optimal codes with respect to the Griesmer and Singleton bounds
- Hamming distances of constacyclic codes of length \(7p^s\) over \(\mathbb{F}_{p^m}\)
- scientific article; zbMATH DE number 5296403 (Why is no real title available?)
- Maximum distance<tex>q</tex>-nary codes
- On constacyclic codes of length \(9 p^s\) over \(\mathbb{F}_{p^m}\) and their optimal codes
- On repeated-root constacyclic codes of length 4p^s
- On repeated-root cyclic codes
- On the algebraic structure of quasi-cyclic codes .I. Finite fields
- On the Hamming distances of repeated-root constacyclic codes of length 4p^s
- On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions
- Polycyclic codes over Galois rings with applications to repeated-root constacyclic codes
- Quantum error correction via codes over GF(4)
- Repeated-root constacyclic codes of length
- Repeated-root constacyclic codes of length \(2 \ell^m p^n\)
- Repeated-root constacyclic codes of length 3lp^s and their dual codes
- Repeated-root constacyclic codes of length \(4\ell^{m}p^{n}\)
- Repeated-root constacyclic codes of length \(\ell p^s\) and their duals
- Repeated-root cyclic and negacyclic codes of length \(6p^s\)
- Structure of repeated-root constacyclic codes of length 3p^s and their duals
- The Hamming distances of repeated-root cyclic codes of length 5 p^s
- The minimum Hamming distance of cyclic codes of length 2p^s
This page was built for publication: On constacyclic codes of length \(10p^s\) over \(\mathbb{F}_{p^m}\) and their optimal codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7356966)
