跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+979新增论文
+781其中 AI 相关
+119已有论文修订
+95新增 AI 导读

arXiv 最近完成扫描:2026-11-20 08:48 · 全站最近入库:2026-11-20 19:58各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-20 08:48最近发现新增版本:2026-11-20 19:58库内论文最新更新时间:2026-11-20 02:59

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

28,961 已收录论文24,030 AI 相关8,912 有修订112 HF 社区发现

浏览论文库

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

找到 2 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-20 08:46(北京时间)
新论文 · v1arXiv:2611.24527

Hull variation of algebraic geometry codes under divisor twists

Erik Mendoza, Sihem Mesnager, Luciane Quoos

原文摘要

The hull $\mathrm{Hull}(\mathcal{C})=\mathcal{C}\cap\mathcal{C}^{\perp}$ of a linear code $\mathcal{C}\subseteq\mathbb{F}_q^n$ interpolates between linear complementary dual (LCD) codes, with trivial hull, and self-dual codes. Its dimension is preserved by coordinate permutations but not by scalings $\mathcal{C}\mapsto\mathbf{x}\cdot\mathcal{C}$, $\mathbf{x}\in(\mathbb{F}_q^*)^n$. This governs the complexity of Sendrier's support-splitting algorithm and decides whether an equivalence class contains LCD codes. We study this hull-variation problem, formalised by Chen, for algebraic geometry codes $\mathcal{C}(D,G)$ over a function field $\mathcal{F}/\mathbb{F}_q$ of genus $g>0$, where scalings are twists of $G$ by principal divisors; as a natural relaxation, we allow twists $G\mapsto G+L$ by arbitrary divisors. Writing $\mathcal{C}(D,G)^{\perp}=\mathcal{C}(D,H)$, with $H=D-G+W$, $W$ canonical, a twist acts by $(G,H)\mapsto(G+L,H-L)$. Whenever $\gcd(G+L,H-L)$ is non-special, the hull dimensions of $\mathcal{C}(D,G+L)$ and $\mathcal{C}(D,G)$ differ by exactly $\frac12(\mathrm{deg}|G-H|-\mathrm{deg}|G-H+2L|)$. For a genuine scaling, $L=-(z)$, this variation is bounded by $2[\mathcal{F}:\mathbb{F}_q(z)]$. Under the same hypothesis, we obtain an upper bound on the hull dimension depending only on $D$ and $W$, and characterise exactly when it is attained by a scaling of it. These bounds shed new light on Chen's maximal hull dimension; explicit scalings on Kummer extensions show that the first is sharp. We construct explicit twists that raise, respectively lower, the hull dimension by prescribed amounts, one unit at a time, and apply them to two classical families. Starting from known LCD codes, we reach every hull dimension in an explicit range; starting from a self-dual code ($q$ even) or a code of maximal hull dimension ($q$ odd), we descend to $0$, yielding LCD codes of various dimensions.

cs.IT

新论文 · v1arXiv:2611.22221

Subsystem Stabilizer $(r,δ)$-Locally Recoverable Codes: Characterization, Bounds and Constructions

Yaozong Zhang, Sihem Mesnager, Xiaoqiang Wang, Jian Gao

原文摘要

Local erasure recovery limits the number of physical systems accessed to repair a distributed quantum memory. For subsystem stabilizer codes (SSCs), a basic question is whether erasures can be corrected within a prescribed repair set. In this paper, we study subsystem stabilizer $(r,δ)$-locally recoverable codes ($(r,δ)$-SSLRCs), in which each coordinate belongs to a repair set of size between $δ$ and $r+δ-1$ that corrects any set of up to $δ-1$ erasures while preserving the logical subsystem and allowing the gauge subsystem to change. We first characterize local erasure recovery algebraically and apply this criterion to Calderbank-Shor-Steane (CSS) and Hermitian hull constructions for $(r,δ)$-SSLRCs. For $(r,δ)$-SSLRCs, without assuming purity, we derive a redundancy bound for disjoint repair sets, a supported-subspace bound based on supported stabilizer and gauge subspaces, and a mixed counting bound for known erasures within selected repair sets and errors at unknown positions outside their union. For pure $(r,δ)$-SSLRCs with overlapping repair sets, we establish the Singleton-type and alphabet-dependent bounds, together with explicit Griesmer, Hamming, and Plotkin bounds. Moreover, we construct nine classes of $\F_q$-linear pure $(r,δ)$-SSLRCs from maximum distance separable (MDS) stabilizer codes, Reed-Solomon (RS) codes, and linear codes with MDS Hermitian hulls, which are simultaneously optimal with respect to several bounds for $(r,δ)$-SSLRCs.

cs.IT