当前位置:
X-MOL 学术
›
Adv. Math. Commun.
›
论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Repeated-root constacyclic codes of length \begin{document}$ 6lp^s $\end{document}
Advances in Mathematics of Communications ( IF 0.9 ) Pub Date : 2020-01-08 , DOI: 10.3934/amc.2020051 Tingting Wu , , Li Liu , Lanqiang Li , Shixin Zhu
Advances in Mathematics of Communications ( IF 0.9 ) Pub Date : 2020-01-08 , DOI: 10.3934/amc.2020051 Tingting Wu , , Li Liu , Lanqiang Li , Shixin Zhu
Let $ \mathbb{F}_{q} $ be a finite field with character $ p $ and $ p\neq{3},l\neq{3} $ be different odd primes. In this paper, we study constacyclic codes of length $ 6lp^s $ over finite field $ \mathbb{F}_{q} $. The generator polynomials of all constacyclic codes and their duals are obtained. Moreover, we give the characterization and enumeration of linear complementary dual (LCD) and self-dual constacyclic codes of length $ 6lp^s $ over $ \mathbb{F}_{q} $.
中文翻译:
长度的重复根conconstcyclic码\ begin {document} $ 6lp ^ s $ \ end {document}
假设$ \ mathbb {F} _ {q} $是一个有限域,其字符$ p $和$ p \ neq {3},l \ neq {3} $是不同的奇质数。在本文中,我们研究了在有限域$ \ mathbb {F} _ {q} $上长度为$ 6lp ^ s $的约束循环码。获得所有稳态代码及其对偶的生成多项式。此外,我们给出了长度为$ 6lp ^ s $超过$ \ mathbb {F} _ {q} $的线性互补对偶(LCD)和自对偶稳态编码的表征和枚举。
更新日期:2020-01-08
中文翻译:
长度的重复根conconstcyclic码
假设$ \ mathbb {F} _ {q} $是一个有限域,其字符$ p $和$ p \ neq {3},l \ neq {3} $是不同的奇质数。在本文中,我们研究了在有限域$ \ mathbb {F} _ {q} $上长度为$ 6lp ^ s $的约束循环码。获得所有稳态代码及其对偶的生成多项式。此外,我们给出了长度为$ 6lp ^ s $超过$ \ mathbb {F} _ {q} $的线性互补对偶(LCD)和自对偶稳态编码的表征和枚举。