Hamming distance of repeated-root constacyclic codes of length 2p^s over F_p^m+uF_p^m
From MaRDI portal
Publication:780367
DOI10.1007/S00200-020-00432-0zbMATH Open1458.94323OpenAlexW3020002337MaRDI QIDQ780367FDOQ780367
Publication date: 15 July 2020
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00200-020-00432-0
Recommendations
- On the Hamming distances of repeated-root constacyclic codes of length \(4p^s\)
- 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}\)
- Hamming distances of repeated-root constacyclic codes of prime power lengths over \(\mathbb{F}_{5^m}+u\mathbb{F}_{5^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 \(3p^s\) and optimal codes with respect to the Griesmer and Singleton bounds
Cites Work
- Structure of repeated-root constacyclic codes of length \(3p^s\) and their duals
- On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions
- On repeated-root cyclic codes
- Repeated-root cyclic codes
- Constacyclic codes of length \(p^s\) over \(\mathbb F_{p^m} + u\mathbb F_{p^m}\)
- Repeated-root constacyclic codes of length
- On repeated-root constacyclic codes of length \(4p^s\)
- Polycyclic codes over Galois rings with applications to repeated-root constacyclic codes
- The Minimum Hamming Distance of Cyclic Codes of Length 2p s
- Constacyclic codes of length \(2p^{s}\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
- A class of repeated-root constacyclic codes over \(\mathbb{F}_{p^m} [u] / \langle u^e \rangle\) of type 2
- On the Hamming distances of repeated-root constacyclic codes of length \(4p^s\)
- Constacyclic codes of length \(np^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}\)
- An efficient method to construct self-dual cyclic codes of length \(p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m} \)
- Construction and enumeration for self-dual cyclic codes of even length over \(\mathbb{F}_{2^m} + u \mathbb{F}_{2^m} \)
- On matrix-product structure of repeated-root constacyclic codes over finite fields
- An explicit representation and enumeration for self-dual cyclic codes over \(\mathbb{F}_{2^m}+u\mathbb{F}_{2^m}\) of length \(2^s\)
- A class of linear codes of length 2 over finite chain rings
- On the Symbol-Pair Distance of Repeated-Root Constacyclic Codes of Prime Power Lengths
- Optimal b-symbol constacyclic codes with respect to the Singleton bound
- Symbol-triple distance of repeated-root constacyclic codes of prime power lengths
Cited In (4)
- Lee distance distribution of repeated-root constacyclic codes over \(\mathrm{GR}(2^e,m)\) and related MDS codes
- 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}\)
- 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}\)
Uses Software
This page was built for publication: Hamming distance of repeated-root constacyclic codes of length \(2p^s\) over \({\mathbb{F}}_{p^m}+u{\mathbb{F}}_{p^m} \)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q780367)
