On Hamming distance and RT distance of a class of constacyclic codes over F_p^n+uF_p^n+ +u^t-1F_p^n
From MaRDI portal
Publication:6959006
Cites work
- Algebraic coding theory
- Codes for Symbol-Pair Read Channels
- Codes for the \(m\)-metric
- 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}\)
- Constacyclic Codes of Length $2^s$ Over Galois Extension Rings of ${\BBF}_{2}+u{\BBF}_2$
- 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
- scientific article; zbMATH DE number 5296403 (Why is no real title available?)
- scientific article; zbMATH DE number 1734711 (Why is no real title available?)
- 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 \(2p^s\) over \(\frac{\mathbb{F}_{p^m}[u]}{\langle u^a \rangle}\)
- On constacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m} +u\mathbb{F}_{p^m}\)
- On cyclic and negacyclic codes of length \(8p^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
- Quantum codes from repeated-root cyclic and negacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m} \)
- 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
- RT distance and weight distributions of Type 1 constacyclic codes of length 4ps over Fpm[u]
- RT distances and Hamming distances of constacyclic codes of length \(8p^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}\)
- Structure of repeated-root constacyclic codes of length 8 ^m p^n
- Structure of some classes of repeated-root constacyclic codes of length \(2^{\mathfrak{K}} \ell^m p^n\)
- The minimum Hamming distance of cyclic codes of length 2p^s
This page was built for publication: On Hamming distance and RT distance of a class of constacyclic codes over \(\mathbb{F}_{p^n}+u\mathbb{F}_{p^n}+\cdots +u^{t-1}\mathbb{F}_{p^n}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6959006)