Repeated-root constacyclic codes of length n l p^s
From MaRDI portal
Publication:2359968
Recommendations
- Repeated-root constacyclic codes of length k p^s
- 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 constacyclic codes of length 3 ^m p^s
- Repeated-root constacyclic codes of length \(kl^{a}p^{b}\) over a finite field
- Repeated-root constacyclic codes of length \(4\ell^{m}p^{n}\)
- On repeated-root constacyclic codes of length 4p^s
- Repeated-root constacyclic codes of prime power length
Cites work
- A class of constacyclic codes over a finite field
- A class of constacyclic codes over a finite field. II
- Constacyclic codes of length \(p^s\) over \(\mathbb F_{p^m} + u\mathbb F_{p^m}\)
- Constacyclic codes over finite fields
- Cyclotomic numbers and primitive idempotents in the ring \(\mathrm{GF}(q)[x]/(x^{p^n} - 1)\)
- scientific article; zbMATH DE number 2002850 (Why is no real title available?)
- scientific article; zbMATH DE number 3318360 (Why is no real title available?)
- Linear codes with complementary duals
- On constacyclic codes over finite fields
- 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
- Repeated-root constacyclic codes of length
- Repeated-root constacyclic codes of length \(2 \ell^m p^n\)
- Repeated-root constacyclic codes of length 3lp^s and their dual codes
- 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 constacyclic codes of length \(kl^{a}p^{b}\) over a finite field
- Repeated-root cyclic and negacyclic codes of length \(6p^s\)
- Repeated-root cyclic codes
- 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
(18)- On LCD repeated-root cyclic codes over finite fields
- Repeated-root constacyclic codes of length \(2 \ell^m p^n\)
- Repeated-root constacyclic codes of length \(6lp^s\)
- Repeated-root constacyclic codes of length 3 ^m p^s
- Repeated-root constacyclic codes of length k p^s
- Factorization of composed polynomials and applications
- On repeated-root constacyclic codes of length 4p^s
- Repeated-root constacyclic codes of length \(4\ell^{m}p^{n}\)
- Repeated-root constacyclic codes of length 3lp^s and their dual codes
- Repeated root cyclic \(\mathbb{F}_q\)-linear codes over \(\mathbb{F}_{q^l}\)
- On Repeated-Single-Root Constacyclic Codes
- Repeated-root cyclic and negacyclic codes of length \(6p^s\)
- Repeated-root constacyclic codes of length \(kl^{a}p^{b}\) over a finite field
- Further study of repeated-root cyclic codes
- Repeated-root constacyclic codes of length
- Repeated-root constacyclic codes of length k^s l^m p^n over finite fields
- Explicit representatives and sizes of cyclotomic cosets and their application to cyclic codes over finite fields
- Closed formulas for the generators of all constacyclic codes and for the factorization of \(X^{n} - 1\), the \(n\)-th cyclotomic polynomial and every composition of the form \(f(X^n)\) over a finite field for arbitrary positive integers \(n\)
This page was built for publication: Repeated-root constacyclic codes of length \(n l p^s\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2359968)
