The minimum Hamming distances of the irreducible cyclic codes of length l₁^m₁l₂^m₂ l_r^m_r
From MaRDI portal
Publication:5069838
Recommendations
Cites work
- scientific article; zbMATH DE number 5844200 (Why is no real title available?)
- scientific article; zbMATH DE number 5968526 (Why is no real title available?)
- scientific article; zbMATH DE number 5296403 (Why is no real title available?)
- scientific article; zbMATH DE number 2002850 (Why is no real title available?)
- Constacyclic codes over finite fields
- Cyclic codes of length \(2^m\)
- Explicit factorization of \(X^{2^m}p^n-1\) over a finite field
- Minimal codes of prime-power length.
- Minimal cyclic codes of length \(2p^n\)
- Minimal cyclic codes of length \(p^{n} q\).
- Some cyclic codes of length \(2p^n\)
- The minimum Hamming distances of irreducible cyclic codes
Cited in
(11)- Some combinatorial identities
- Quantum codes from cyclic codes over the ring \(F_p [u] / \langle u^3 - u \rangle \)
- Skew cyclic and skew constacyclic codes over the ring \(\mathbb{F}_p + u_1 \mathbb{F}_p + \dots + u_{2 m} \mathbb{F}_p\)
- A class of minimal cyclic codes over finite fields
- A class of negacyclic codes over finite field
- On cyclic and negacyclic codes of length 8ℓmpn over finite field
- The minimum Hamming distances of irreducible cyclic codes
- Cyclic codes with generalized cyclotomic cubic classes
- Primitive idempotents of irreducible cyclic codes of length \(n\)
- The minimum Hamming distance of cyclic codes of length \(2p^s\)
- The weight distributions of irreducible cyclic codes of length \(2^n p^m\)
This page was built for publication: The minimum Hamming distances of the irreducible cyclic codes of length \(l_1^{m_1}l_2^{m_2} \dots l_r^{m_r}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5069838)