arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1406.1848cs.ITmath.IT
收藏

长度为$2\ell^mp^n$的重根常循环码

Repeated-root constacyclic codes of length $2\ell^mp^n$

Bocong Chen, Hai Q. Dinh, Hongwei Liu

摘要:

对任意不同的奇素数$\ell$和$p$,利用其生成多项式建立了特征$p$的有限域$\mathbb F_q$上长度为$2\ell^mp^n$的常循环码及其子码的结构.得到了$\mathbb F_q$上长度为$2\ell^mp^n$的所有线性互补对偶和自对偶常循环码.

英文摘要:

For any different odd primes $\ell$ and $p$, structure of constacyclic codes of length $2\ell^mp^n$ over a finite field $\mathbb F_q$ of characteritic $p$ and their duals is established in term of their generator polynomials. Among other results, all linear complimentary dual and self-dual constacyclic codes of length $2\ell^mp^n$ over $\mathbb F_q$ are obtained.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑