A class of constacyclic codes over a finite field
From MaRDI portal
Publication:765806
DOI10.1016/j.ffa.2011.09.005zbMath1250.94067OpenAlexW2014597889MaRDI QIDQ765806
Publication date: 22 March 2012
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ffa.2011.09.005
self-dual codesconstacyclic codescyclotomic cosetsnegacyclic codesreduced residue systemrepeated-root constacyclic codes
Related Items
Repeated-root constacyclic codes of length \(n l p^s\) ⋮ Two dimensional constacyclic codes of arbitrary length over finite fields ⋮ Repeated-root constacyclic codes of length \(4\ell^{m}p^{n}\) ⋮ On constacyclic codes over finite fields ⋮ A class of constacyclic codes over a finite field. II ⋮ Constacyclic codes of length \(kl^{m}p^{n}\) over a finite field ⋮ Repeated-root constacyclic codes of length \(3lp^s\) and their dual codes ⋮ Repeated-root constacyclic codes of length \(3 \ell^m p^s\) ⋮ Constacyclic and quasi-twisted Hermitian self-dual codes over finite fields ⋮ Some new constructions of isodual and LCD codes over finite fields ⋮ Primitive idempotent tables of cyclic and constacyclic codes ⋮ A study of primer design with \(w\)-constacyclic shift over \(\mathbb{F}_4\) ⋮ Two-sided Galois duals of multi-twisted codes ⋮ Repeated-root constacyclic codes of length \(\ell^{t}p^{s}\) and their dual codes ⋮ Repeated-root constacyclic codes of length \(\ell p^s\) and their duals ⋮ Enumeration of self-dual and self-orthogonal negacyclic codes over finite fields ⋮ Non-binary quantum synchronizable codes based on cyclic codes over \(\mathrm{F}_q\) ⋮ Repeated-root constacyclic codes of length \(6l^mp^n\) ⋮ On negacyclic MDS-convolutional codes ⋮ Optimal b-symbol constacyclic codes with respect to the Singleton bound ⋮ Some families of optimal quantum codes derived from constacyclic codes ⋮ On the Hamming distances of repeated-root constacyclic codes of length \(4p^s\) ⋮ Unnamed Item ⋮ Self-dual and self-orthogonal negacyclic codes of length \(2^m p^n\) over a finite field ⋮ New optimal asymmetric quantum codes and quantum convolutional codes derived from constacyclic codes ⋮ Quantum codes from repeated-root cyclic and negacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m} \) ⋮ \((1-2u^{3})\)-constacyclic codes and quadratic residue codes over \(\mathbb {F}_{p}[u/\langle u^{4}-u\rangle \)] ⋮ Constacyclic codes over finite fields ⋮ Repeated-root constacyclic codes of length \(kl^{a}p^{b}\) over a finite field ⋮ Repeated-root constacyclic codes of length \(2 \ell^m p^n\) ⋮ Repeated-root constacyclic codes of length \(6lp^s\) ⋮ The average dimension of the Hermitian hull of constacyclic codes over finite fields of square order ⋮ Some families of asymmetric quantum MDS codes constructed from constacyclic codes ⋮ On optimal constacyclic codes ⋮ On matrix-product structure of repeated-root constacyclic codes over finite fields ⋮ On the \(b\)-distance of repeated-root constacyclic codes of prime power lengths ⋮ Repeated-root constacyclic codes of length \(k\ell p^s\) ⋮ Structure of repeated-root constacyclic codes of length 8ℓmpn ⋮ Unnamed Item ⋮ On the symbol-pair distances of repeated-root constacyclic codes of length \(2 p^s\) ⋮ Factorization of composed polynomials and applications ⋮ Structure of some classes of repeated-root constacyclic codes of length \(2^{\mathfrak{K}} \ell^m p^n\) ⋮ A class of constacyclic codes containing formally self-dual and isodual codes ⋮ Some families of asymmetric quantum codes and quantum convolutional codes from constacyclic codes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constacyclic codes of length \(p^s\) over \(\mathbb F_{p^m} + u\mathbb F_{p^m}\)
- Negacyclic duadic codes
- Constacyclic codes as invariant subspaces
- A class of constacyclic codes over \(\mathbb Z_{p^m}\)
- Dual and self-dual negacyclic codes of even length over \(\mathbb Z_{2^a}\)
- Minimal cyclic codes of length \(p^{n} q\).
- Cyclic codes over \(\mathbb{Z}_{4}\) of oddly even length.
- The weight distributions of irreducible cyclic codes of length \(2^m\)
- On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions
- Cyclotomic numbers and primitive idempotents in the ring \(\mathrm{GF}(q)[x/(x^{p^n} - 1)\)]
- Negacyclic Codes of Length<tex>$2^s$</tex>Over Galois Rings
- Cyclic and Negacyclic Codes Over Finite Chain Rings
- Complete Distances of All Negacyclic Codes of Length $2^{s}$ Over $\BBZ _{2^{a}}$
- Negacyclic codes over Z/sub 4/ of even length
- A class of constacyclic codes
- Constacyclic Codes of Length $2^s$ Over Galois Extension Rings of ${\BBF}_{2}+u{\BBF}_2$
- On repeated-root cyclic codes
- Repeated-root cyclic codes
