Hamming distances of repeated-root constacyclic codes of prime power lengths over F₅^m+uF₅^m
From MaRDI portal
Publication:5236396
Recommendations
- Hamming distance of repeated-root constacyclic codes of length \(2p^s\) over \({\mathbb{F}}_{p^m}+u{\mathbb{F}}_{p^m} \)
- Some classes of repeated-root constacyclic codes over \(\mathbb F_{p^m}+u\mathbb F_{p^m}+u^2\mathbb F_{p^m}\)
- On the Hamming distances of repeated-root constacyclic codes of length 4p^s
- Repeated-root constacyclic codes of prime power length over \(\frac{\mathbb{F}_{p^m} [u]}{\langle u^a \rangle}\) and their duals
- 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}\)
Cited in
(5)- The Hamming distances of repeated-root cyclic codes of length 5 p^s
- Hamming distance of repeated-root constacyclic codes of length \(2p^s\) over \({\mathbb{F}}_{p^m}+u{\mathbb{F}}_{p^m} \)
- On Hamming distance distributions of repeated-root constacyclic codes of length \(3p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
- A note on: ``Hamming distance of repeated-root constacyclic codes of length \(2p^s\) over \({\mathbb{F}}_{p^m}+u{\mathbb{F}}_{p^m}\)
- Hamming distances of constacyclic codes of length \(6p^s\) over \(\frac{\mathbb{F}_{p^m}[u]}{\langle u^2\rangle}\)
This page was built for publication: Hamming distances of repeated-root constacyclic codes of prime power lengths over \(\mathbb{F}_{5^m}+u\mathbb{F}_{5^m}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5236396)
