Repeated-root constacyclic codes of length 2 ^m p^n
From MaRDI portal
Publication:2011488
Abstract: For any different odd primes and , structure of constacyclic codes of length over a finite field of characteritic and their duals is established in term of their generator polynomials. Among other results, all linear complimentary dual and self-dual constacyclic codes of length over are obtained.
Recommendations
Cites work
- A class of constacyclic codes over a finite field
- Constacyclic codes of length \(p^s\) over \(\mathbb F_{p^m} + u\mathbb F_{p^m}\)
- Constacyclic codes over finite fields
- Cyclic and Negacyclic Codes Over Finite Chain Rings
- Cyclotomic numbers and primitive idempotents in the ring \(\mathrm{GF}(q)[x]/(x^{p^n} - 1)\)
- Existence of cyclic self-orthogonal codes: a note on a result of Vera Pless
- Fundamentals of Error-Correcting Codes
- scientific article; zbMATH DE number 5296403 (Why is no real title available?)
- scientific article; zbMATH DE number 3760078 (Why is no real title available?)
- Linear codes with complementary duals
- Linear codes with complementary duals meet the Gilbert-Varshamov bound
- Negacyclic and cyclic codes over Z/sub 4/
- On complementary-dual quasi-cyclic codes
- On cyclic MDS codes of length q over GF(q) (Corresp.)
- On cyclic self-dual codes
- On repeated-root cyclic codes
- On Self-Dual Cyclic Codes Over Finite Fields
- On the distances of cyclic codes of length \(2^e\) over \(\mathbb Z_4\)
- On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions
- Polynomial weights and code constructions
- Repeated-root constacyclic codes of length
- Repeated-root constacyclic codes of length \(\ell p^s\) and their duals
- Repeated-root cyclic and negacyclic codes of length \(6p^s\)
- Repeated-root cyclic and negacyclic codes over a finite chain ring
- Repeated-root cyclic codes
- Self-dual and self-orthogonal negacyclic codes of length 2p^n over a finite field
- Semisimple cyclic and Abelian codes. II
- Structure of repeated-root constacyclic codes of length 3p^s and their duals
- The condition for a cyclic code to have a complementary dual
Cited in
(44)- Constacyclic codes of length \(kl^{m}p^{n}\) over a finite field
- Constacyclic codes over \(\mathbb{F}_{p^m}[u_1, u_2, \cdots, u_k]/\langle u_i^2 = u_i, u_i u_j = u_j u_i \rangle\)
- Repeated-root two-dimensional constacyclic codes of length \(2p^s\cdot 2^k\)
- On the Hamming distances of repeated-root constacyclic codes of length 4p^s
- On complementary dual quasi-twisted codes
- Repeated-root constacyclic codes over \(\mathbb{F}_2 + u \mathbb{F}_2 + v \mathbb{F}_2 + u v \mathbb{F}_2\)
- Structure of repeated-root constacyclic codes of length 3p^s and their duals
- Hamming distances of constacyclic codes of length 3p^s and optimal codes with respect to the Griesmer and Singleton bounds
- Repeated-root bidimensional \((\mu, \nu)\)-constacyclic codes of length \(4p^t.2^r\)
- Repeated-root constacyclic codes of length \(6lp^s\)
- The minimum Hamming distances of repeated-root cyclic codes of length \(6p^s\) and their MDS codes
- Non-binary quantum codes from constacyclic codes over \(\mathbb{F}_q [u_1, u_2,\dots,u_k]/\langle u_i^3 = u_i, u_i u_j = u_j u_i \rangle\)
- Two new families of quantum synchronizable codes
- Repeated-root constacyclic codes of length 3 ^m p^s
- Self-reciprocal and self-conjugate-reciprocal irreducible factors of \(x^n - \lambda\) and their applications
- Repeated-root constacyclic codes of length k p^s
- Structure of some classes of repeated-root constacyclic codes of length \(2^{\mathfrak{K}} \ell^m p^n\)
- Repeated-root constacyclic codes of length \(n l p^s\)
- The weight distributions of constacyclic codes
- Repeated-root constacyclic codes of length \(4\ell^{m}p^{n}\)
- Repeated-root constacyclic codes of length 3lp^s and their dual codes
- Complementary dual codes for counter-measures to side-channel attacks
- Repeated-root constacyclic codes of length \(\ell p^s\) and their duals
- Repeated-root constacyclic codes of arbitrary lengths over the Galois ring GR(p2,m)
- On cyclic and negacyclic codes of length 8ℓmpn over finite field
- On Repeated-Single-Root Constacyclic Codes
- Self-dual and self-orthogonal negacyclic codes of length 2ᵐ p^n over a finite field
- Repeated-root constacyclic codes of length $2p^s$ over Galois rings
- On MDS negacyclic LCD codes
- A class of constacyclic codes from group algebras
- On cyclic codes of length \(p^n\ell^m\) over a finite field
- Structure of repeated-root constacyclic codes of length 8 ^m p^n
- Repeated-root constacyclic codes of length \(kl^{a}p^{b}\) over a finite field
- Repeated-root constacyclic codes of length \(6l^mp^n\)
- Hamming distances of constacyclic codes of length \(7p^s\) over \(\mathbb{F}_{p^m}\)
- On constacyclic codes of length \(9 p^s\) over \(\mathbb{F}_{p^m}\) and their optimal codes
- Repeated-root constacyclic codes of length
- On isometry and equivalence of skew constacyclic codes
- Repeated-root constacyclic codes of length k^s l^m p^n over finite fields
- Multi-dimensional constacyclic codes of arbitrary length over finite fields
- Explicit representatives and sizes of cyclotomic cosets and their application to cyclic codes over finite fields
- Some results on the Hamming distances of cyclic codes
- On constacyclic codes of length \(10p^s\) over \(\mathbb{F}_{p^m}\) and their optimal codes
- The Hamming distances of repeated-root cyclic codes of length 5 p^s
This page was built for publication: Repeated-root constacyclic codes of length \(2 \ell^m p^n\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2011488)
