← 研踪 PaperTrailarXiv:2611.24527 · v1
Hull variation of algebraic geometry codes under divisor twists
首次提交 2026-11-18 22:41
版本更新 2026-11-18 22:41
雷达观测 2026-11-19 15:04
摘要
The hull of a linear code 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 , . 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 over a function field of genus , where scalings are twists of by principal divisors; as a natural relaxation, we allow twists by arbitrary divisors. Writing , with , canonical, a twist acts by . Whenever is non-special, the hull dimensions of and differ by exactly . For a genuine scaling, , this variation is bounded by . Under the same hypothesis, we obtain an upper bound on the hull dimension depending only on and , 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 ( even) or a code of maximal hull dimension ( odd), we descend to , yielding LCD codes of various dimensions.
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-18 22:41 · 最新观测版本
Hull variation of algebraic geometry codes under divisor twists
The hull of a linear code 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 , . 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 over a function field of genus , where scalings are twists of by principal divisors; as a natural relaxation, we allow twists by arbitrary divisors. Writing , with , canonical, a twist acts by . Whenever is non-special, the hull dimensions of and differ by exactly . For a genuine scaling, , this variation is bounded by . Under the same hypothesis, we obtain an upper bound on the hull dimension depending only on and , 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 ( even) or a code of maximal hull dimension ( odd), we descend to , yielding LCD codes of various dimensions.
查看此版本解读 →查看此版本原文 ↗