On Hamming and b-symbol distance distributions of repeated-root constacyclic codes of length 4p^s over F_p^m+u F_p^m
From MaRDI portal
Publication:2053264
Recommendations
- On Hamming distance distributions of repeated-root constacyclic codes of length \(3p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
- On the Hamming distances of repeated-root constacyclic codes of length 4p^s
- Hamming distance of repeated-root constacyclic codes of length \(2p^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 $b$ -Symbol Distances of Repeated-Root Constacyclic Codes
- The symbol-pair distance distribution of a class of repeated-root cyclic codes over \(\mathbb {F}_{p^{m}}\)
- 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
- On the symbol-pair distances of repeated-root constacyclic codes of length \(2 p^s\)
- The distributions of distances of \((1+\lambda u)\)-constacyclic codes of length \(p^s\) over \(F_{p^m}+uF_{p^m}+\cdots +u^{k-1}F_{p^m}\)
- \(b\)-symbol distance distribution of repeated-root cyclic codes
Cites work
- Codes for Symbol-Pair Read Channels
- Constacyclic codes of length \(p^s\) over \(\mathbb F_{p^m} + u\mathbb F_{p^m}\)
- Constructions and Decoding of Cyclic Codes Over <inline-formula> <tex-math notation="LaTeX">$b$ </tex-math> </inline-formula>-Symbol Read Channels
- Cyclic and negacyclic codes of length \(4 p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
- Cyclic and Negacyclic Codes Over Finite Chain Rings
- Maximum distance separable codes for b-symbol read channels
- On \((\alpha + u \beta)\)-constacyclic codes of length \(4 p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}^\ast\)
- On a class of constacyclic codes of length \(4 p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
- On constacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m} +u\mathbb{F}_{p^m}\)
- On cyclic MDS codes of length q over GF(q) (Corresp.)
- On repeated-root constacyclic codes of length 4p^s
- On repeated-root cyclic codes
- On the Hamming distance of linear codes over a finite chain ring
- 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
- 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
- Repeated root constacyclic codes of length \(mp^{s}\) over \(\mathbb{F}_{p^r} + u\mathbb{F}_{p^r} + \cdots + u^{e-1}\mathbb{F}_{p^r}\)
- Repeated-root constacyclic codes of length
- Repeated-root constacyclic codes of length 3lp^s and their dual codes
- Repeated-root cyclic codes
- Semisimple cyclic and Abelian codes. II
- Structure of repeated-root constacyclic codes of length 3p^s and their duals
- Symbol-triple distance of repeated-root constacyclic codes of prime power lengths
Cited in
(16)- The symbol-pair distance distribution of a class of repeated-root cyclic codes over \(\mathbb {F}_{p^{m}}\)
- On the Hamming distances of repeated-root constacyclic codes of length 4p^s
- Hamming distances of constacyclic codes of length 3p^s and optimal codes with respect to the Griesmer and Singleton bounds
- On the \(b\)-distance of repeated-root constacyclic codes of prime power lengths
- On the symbol-pair distances of repeated-root constacyclic codes of length \(2 p^s\)
- A note on: ``Hamming distance of repeated-root constacyclic codes of length \(2p^s\) over \({\mathbb{F}}_{p^m}+u{\mathbb{F}}_{p^m}\)
- Optimal b-symbol constacyclic codes with respect to the Singleton bound
- Symbol-triple distance of repeated-root constacyclic codes of prime power lengths
- Hamming distances of repeated-root constacyclic codes of prime power lengths over \(\mathbb{F}_{5^m}+u\mathbb{F}_{5^m}\)
- RT distance and weight distributions of Type 1 constacyclic codes of length 4ps over Fpm[u]
- 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
- On Hamming distance distributions of repeated-root constacyclic codes of length \(3p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
- Symbol-pair distance of some repeated-root constacyclic codes of length \(p^s\) over the Galois ring \(\mathrm{GR}(p^a, m)\)
- On the MDS \(b\)-symbol of repeated-root constacyclic codes of prime power length over \(\mathbb{F}_{p^m} + u\mathbb{F}_{p^m}+u^2 \mathbb{F}_{p^m}\)
- On symbol-pair distance distributions of repeated-root constacyclic codes of length 4p^s and MDS codes
- Hamming distance of repeated-root constacyclic codes of length \(2p^s\) over \({\mathbb{F}}_{p^m}+u{\mathbb{F}}_{p^m} \)
This page was built for publication: 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}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2053264)
