Repeated-root constacyclic codes of length \(kl^{a}p^{b}\) over a finite field
From MaRDI portal
Publication:530402
DOI10.1016/J.FFA.2016.06.006zbMath1372.94466OpenAlexW2491329261MaRDI QIDQ530402
Publication date: 29 July 2016
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ffa.2016.06.006
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Cyclic codes (94B15)
Related Items (5)
Repeated-root constacyclic codes of length \(n l p^s\) ⋮ Constacyclic codes of length \(kl^{m}p^{n}\) over a finite field ⋮ Repeated-root constacyclic codes of length \(3 \ell^m p^s\) ⋮ Repeated-root constacyclic codes of length \(6lp^s\) ⋮ Repeated-root constacyclic codes of length \(k\ell p^s\)
Cites Work
- 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
- Constacyclic codes over finite fields
- A class of constacyclic codes over a finite field
- Structure of repeated-root constacyclic codes of length \(3p^s\) and their duals
- Repeated-root constacyclic codes of length \(2 \ell^m p^n\)
- A class of minimal cyclic codes over finite fields
This page was built for publication: Repeated-root constacyclic codes of length \(kl^{a}p^{b}\) over a finite field