Repeated-root constacyclic codes of length \(6lp^s\)
From MaRDI portal
Publication:2025356
DOI10.3934/amc.2020051zbMath1465.94120OpenAlexW2999955196MaRDI QIDQ2025356
Tingting Wu, Lanqiang Li, Li Liu, Shixin Zhu
Publication date: 12 May 2021
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2020051
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Cyclic codes (94B15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Repeated-root constacyclic codes of length \(3lp^s\) and their dual codes
- Existence of cyclic self-orthogonal codes: a note on a result of Vera Pless
- Repeated-root constacyclic codes of length \(\ell p^s\) and their duals
- 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
- A class of constacyclic codes over a finite field
- On the distances of cyclic codes of length \(2^e\) over \(\mathbb Z_4\)
- Constacyclic codes of length \(kl^{m}p^{n}\) 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\)
- 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)\)]
- On Self-Dual Cyclic Codes Over Finite Fields
- On repeated-root cyclic codes
- Repeated-root cyclic codes
This page was built for publication: Repeated-root constacyclic codes of length \(6lp^s\)
