跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+0新增论文
+0其中 AI 相关
+0已有论文修订
+92新增 AI 导读

arXiv 最近完成扫描:2026-11-23 01:07 · 全站最近入库:2026-11-21 12:19各信源进度 →

统计口径与数据新鲜度

统计 2026-11-22 06:44 — 2026-11-23 06:44(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-23 01:07最近发现新增版本:2026-11-21 12:19库内论文最新更新时间:2026-11-20 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

29,158 已收录论文24,181 AI 相关8,992 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 2 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-23 01:05(北京时间)
版本更新 · v2arXiv:2611.13481

Euclidean Hulls of Double Cyclic Codes of Arbitrary Block Lengths

Awadhesh Kumar Shukla, Om Prakash Pandey, Sachin Pathak, Ashish Upadhyay

原文摘要

A $\mathbb{Z}_2$-double cyclic code of block length $(r,s)$ can be viewed as a $\mathbb{Z}_2[x]$-submodule of $\mathbb{Z}_2[x]/\langle x^r - 1 \rangle \times \mathbb{Z}_2[x]/\langle x^s - 1 \rangle$. In 2023, Gao et al. \cite{GWF23} investigated the Euclidean hulls of double cyclic codes over $\mathbb{Z}_2$ for both separable and non-separable cases. In the non-separable setting, they determined the hull generators under the assumption that the block lengths are coprime (i.e., $\gcd(r,s)=1$) and left the non-coprime case ($\gcd(r,s) > 1$) as an open problem. In this paper, we resolve this open problem by deriving the explicit hull generators for arbitrary block lengths $(r,s)$, recovering the coprime setting as a special case of our framework. Furthermore, we establish the necessary and sufficient conditions for non-separable double cyclic codes to be linear complementary dual (LCD) and provide several numerical examples to validate our theoretical findings.

cs.IT

版本更新 · v2arXiv:2404.00613

On $(θ, Θ)$-cyclic codes and their applications in constructing QECCs

Awadhesh Kumar Shukla, Sachin Pathak, Om Prakash Pandey, Vipul Mishra, Ashish Kumar Upadhyay

原文摘要

Let $\mathbb F_q$ be a finite field, where $q$ is an odd prime power. Let $R=\mathbb{F}_q+u\mathbb{F}_q+v\mathbb{F}_q+uv\mathbb F_q$ with $u^2=u,v^2=v,uv=vu$. In this paper, we study the algebraic structure of $(θ, Θ)$-cyclic codes of block length $(r,s )$ over $\mathbb{F}_qR.$ Specifically, we analyze the structure of these codes as left $R[x:Θ]$-submodules of $\mathfrak{R}_{r,s} = \frac{\mathbb{F}_q[x:θ]}{\langle x^r-1\rangle} \times \frac{R[x:Θ]}{\langle x^s-1\rangle}$. Our investigation involves determining generator polynomials and minimal generating sets for this family of codes. Further, we discuss the algebraic structure of separable codes. A relationship between the generator polynomials of $(θ, Θ)$-cyclic codes over $\mathbb F_qR$ and their duals is established. Moreover, we calculate the generator polynomials of dual of $(θ, Θ)$-cyclic codes. As an application of our study, we provide a construction of quantum error-correcting codes (QECCs) from $(θ, Θ)$-cyclic codes of block length $(r,s)$ over $\mathbb{F}_qR$. We support our theoretical results with illustrative examples.

cs.IT