On b-symbol distance, Hamming distance and RT distance of type 1 -constacyclic codes of length 8 p^s over F_p^m[u]/ u^k
From MaRDI portal
Publication:6877374
Cites work
- A class of constacyclic codes over \({\mathbb{F}}_{p^m}[u]/\langle u^2\rangle\)
- Algebraic coding theory
- Codes for Symbol-Pair Read Channels
- Codes for the \(m\)-metric
- Constacyclic Codes of Length $2^s$ Over Galois Extension Rings of ${\BBF}_{2}+u{\BBF}_2$
- Constacyclic codes of length \(2p^{s}\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
- Constacyclic codes of length \(np^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}\)
- 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 Over Finite Chain Rings
- Cyclic codes over \(\text{GR}(p^2,m)\) of length \(p^k\)
- Fundamentals of Error-Correcting Codes
- scientific article; zbMATH DE number 5296403 (Why is no real title available?)
- scientific article; zbMATH DE number 2164305 (Why is no real title available?)
- Maximum distance separable codes for b-symbol read channels
- Negacyclic codes of length \(2p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
- 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 \(2p^s\) over \(\frac{\mathbb{F}_{p^m}[u]}{\langle u^a \rangle}\)
- On a class of constacyclic codes of length \(4p^s\) over \(\frac{\mathbb{F}_pm[u]}{\langle u^a\rangle}\)
- On constacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m} +u\mathbb{F}_{p^m}\)
- On repeated-root cyclic codes
- 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 Probability of Undetected Error for Linear Block Codes
- Optimal b-symbol constacyclic codes with respect to the Singleton bound
- Polycyclic codes over Galois rings with applications to repeated-root constacyclic codes
- Repeated-root constacyclic codes of prime power length over \(\frac{\mathbb{F}_{p^m} [u]}{\langle u^a \rangle}\) and their duals
- Repeated-root cyclic codes
- The minimum Hamming distance of cyclic codes of length 2p^s
This page was built for publication: On \(b\)-symbol distance, Hamming distance and RT distance of type 1 \(\lambda \)-constacyclic codes of length \(8 p^s\) over \(\mathbb{F}_{p^m}[u]/\langle u^k\rangle \)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6877374)
