Repeated-root constacyclic codes of length 4ᵐp^n
From MaRDI portal
Publication:285476
Recommendations
Cites work
- scientific article; zbMATH DE number 5296403 (Why is no real title available?)
- scientific article; zbMATH DE number 3523640 (Why is no real title available?)
- A class of constacyclic codes over a finite field
- A class of minimal cyclic codes over finite fields
- Algebraic coding theory
- Constacyclic codes of length \(p^s\) over \(\mathbb F_{p^m} + u\mathbb F_{p^m}\)
- Constacyclic codes over finite fields
- Isodual constacyclic codes
- Negacyclic duadic codes
- On Self-Dual Cyclic Codes Over Finite Fields
- On repeated-root constacyclic codes of length \(4p^s\)
- Polyadic codes of prime power length
- Repeated-root constacyclic codes of length
- Repeated-root constacyclic codes of length \(2 \ell^m p^n\)
- Repeated-root constacyclic codes of length \(\ell p^s\) and their duals
- Repeated-root constacyclic codes of length \(\ell^{t}p^{s}\) and their dual codes
- Repeated-root cyclic and negacyclic codes of length \(6p^s\)
- Repeated-root isodual cyclic codes over finite fields
- Self-dual and self-orthogonal negacyclic codes of length \(2^m p^n\) over a finite field
- Structure of repeated-root constacyclic codes of length \(3p^s\) and their duals
Cited in
(22)- Repeated-root constacyclic codes of length \(6l^mp^n\)
- Repeated-root constacyclic codes of length \(k^s l^m p^n\) over finite fields
- Repeated-root two-dimensional constacyclic codes of length \(2p^s\cdot 2^k\)
- Repeated-root constacyclic codes of length \(k\ell p^s\)
- On cyclic and negacyclic codes of length 8ℓmpn over finite field
- Hamming distances of constacyclic codes of length \(7p^s\) over \(\mathbb{F}_{p^m}\)
- A class of constacyclic codes from group algebras
- On the Hamming distances of repeated-root constacyclic codes of length \(4p^s\)
- On repeated-root constacyclic codes of length \(4p^s\)
- On constacyclic codes of length \(9 p^s\) over \(\mathbb{F}_{p^m}\) and their optimal codes
- Hamming distances of constacyclic codes of length \(3p^s\) and optimal codes with respect to the Griesmer and Singleton bounds
- Repeated-root constacyclic codes of length \(\ell^{t}p^{s}\) and their dual codes
- Structure of repeated-root constacyclic codes of length \(8 \ell^m p^n\)
- On constacyclic codes over finite fields
- A class of constacyclic codes over a finite field. II
- Repeated-root constacyclic codes of length \(n l p^s\)
- Repeated-root constacyclic codes of length \(3lp^s\) and their dual codes
- Repeated-root constacyclic codes of length
- Repeated-root constacyclic codes of length \(2 \ell^m p^n\)
- Repeated-root constacyclic codes of length \(kl^{a}p^{b}\) over a finite field
- Structure of some classes of repeated-root constacyclic codes of length \(2^{\mathfrak{K}} \ell^m p^n\)
- On the symbol-pair distances of repeated-root constacyclic codes of length \(2 p^s\)
This page was built for publication: Repeated-root constacyclic codes of length \(4\ell^{m}p^{n}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q285476)
