Constacyclic codes of length \(kl^{m}p^{n}\) over a finite field
From MaRDI portal
Publication:1637184
DOI10.1016/j.ffa.2018.03.004zbMath1404.94149OpenAlexW2795111912MaRDI QIDQ1637184
Publication date: 7 June 2018
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ffa.2018.03.004
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Cyclic codes (94B15)
Related Items (4)
Repeated-root constacyclic codes of length \(6l^mp^n\) ⋮ A characterization of optimal constacyclic locally repairable codes ⋮ Repeated-root constacyclic codes of length \(6lp^s\) ⋮ Self-reciprocal and self-conjugate-reciprocal irreducible factors of \(x^n - \lambda\) and their applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Repeated-root constacyclic codes of length \(\ell p^s\) and their duals
- Self-dual and self-orthogonal negacyclic codes of length \(2^m p^n\) over a finite field
- Repeated-root constacyclic codes of length \(kl^{a}p^{b}\) over a finite field
- Constacyclic codes of length \(p^s\) over \(\mathbb F_{p^m} + u\mathbb F_{p^m}\)
- Repeated-root constacyclic codes of length
- Constacyclic codes over finite fields
- A class of constacyclic codes over a finite field
- All \(\alpha+u\beta\)-constacyclic codes of length \(np^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}\)
- Structure of repeated-root constacyclic codes of length \(3p^s\) and their duals
- Repeated-root constacyclic codes of length \(2 \ell^m p^n\)
- Cyclotomic numbers and primitive idempotents in the ring \(\mathrm{GF}(q)[x/(x^{p^n} - 1)\)]
- Fundamentals of Error-Correcting Codes
- A class of minimal cyclic codes over finite fields
This page was built for publication: Constacyclic codes of length \(kl^{m}p^{n}\) over a finite field
