pith. machine review for the scientific record. sign in

arxiv: 2605.14046 · v1 · submitted 2026-05-13 · 🧮 math.AG · cs.IT· math.IT· math.NT

Recognition: no theorem link

Construction of Non-special Divisors on Kummer Covers With Arbritary Ramification For LCP Codes

Authors on Pith no claims yet

Pith reviewed 2026-05-15 02:33 UTC · model grok-4.3

classification 🧮 math.AG cs.ITmath.ITmath.NT
keywords Kummer coversnon-special divisorsLCP codesalgebraic geometry codesGalois actionsramificationfunction fieldsGoppa distance
0
0 comments X

The pith

Galois group actions and invariant divisors give necessary and sufficient conditions for non-speciality in Kummer extensions with arbitrary ramification.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper develops a framework to find non-special divisors of degree g and g-1 in Kummer function fields y^m equals the product over i of (x minus alpha sub i) to the lambda sub i, where the ramification can follow any pattern rather than only total ramification at each place. Existing constructions of linear complementary pair algebraic geometry codes were blocked by this support restriction, limiting the function fields that could be used for codes resistant to side-channel and fault-injection attacks. The new conditions rely on the action of the Galois group on divisors together with invariant techniques and remove any constraint on where the divisor is supported. This replaces the heavy Weierstrass semigroup calculations with a direct check that works for three different ramification regimes. The result is explicit new families of LCP codes whose length, dimension, and distance are determined and that reach or approach the Goppa designed distance.

Core claim

Using Galois group actions and invariant divisor techniques, we establish necessary and sufficient conditions for non-speciality with no constraint on the support, yielding explicit constructions where previous methods fail for general Kummer extensions y^m = prod (x - alpha_i)^lambda_i over finite fields. As an application we construct new explicit families of LCP AG codes with determined parameters [n,k,d] covering three ramification regimes that meet or approach the Goppa designed distance.

What carries the argument

Galois group actions on divisors together with invariant divisor techniques that certify non-speciality without any restriction on the support of the divisor.

If this is right

  • Explicit non-special divisors of degree g and g-1 become available for any ramification pattern in the Kummer cover.
  • New families of LCP AG codes are obtained with fully determined parameters [n,k,d] in three ramification regimes.
  • The resulting codes meet or approach the Goppa designed distance.
  • The Weierstrass semigroup machinery is replaced by a direct check based on Galois invariants.
  • The range of function fields usable for side-channel resistant LCP codes is enlarged.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same invariant technique might extend to other Galois covers beyond Kummer type.
  • The efficiency gain could allow larger-genus examples to be handled by machine computation for concrete cryptographic parameters.
  • One could test whether the constructed codes achieve the claimed distance by running the standard decoding algorithms on sample instances.

Load-bearing premise

The Galois group actions on divisors remain sufficient to certify non-speciality for arbitrary ramification patterns without hidden exceptions or additional constraints in the three regimes covered.

What would settle it

Compute the Riemann-Roch space dimension directly for a small finite field, a chosen Kummer extension with mixed ramification, and a divisor that satisfies the stated necessary and sufficient conditions; if the dimension is positive when the conditions predict it should be zero, the claim fails.

read the original abstract

Linear Complementary Pairs (LCP) of algebraic geometry (AG) codes offer strong resistance against side-channel and fault-injection attacks, but their construction depends critically on the explicit identification of non-special divisors of degree $g$ and $g-1$. Existing constructions are restricted to Kummer extensions where divisors are supported exclusively on totally ramified places, significantly limiting the range of applicable function fields and codes. We remove this restriction by developing a framework for general Kummer extensions $y^m = \prod_{i=1}^r (x-\alpha_i)^{\lambda_i}$ over finite fields with arbitrary ramification. Using Galois group actions and invariant divisor techniques, we establish necessary and sufficient conditions for non-speciality with no constraint on the support, yielding explicit constructions where previous methods fail. Our approach replaces the computationally intensive Weierstrass semigroup machinery with a more direct and efficient framework. As an application, we construct new explicit families of LCP AG codes with determined parameters $[n,k,d]$, covering three ramification regimes. The resulting codes meet or approach the Goppa designed distance, offering greater flexibility for cryptographic applications.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The paper develops a framework using Galois group actions and invariant-divisor techniques to construct non-special divisors of degree g and g-1 on general Kummer covers y^m = ∏(x−α_i)^λ_i with arbitrary ramification indices λ_i. It claims necessary and sufficient conditions for non-speciality with no support restrictions, replaces Weierstrass-semigroup methods with a direct approach, and applies the results to explicit LCP AG-code families in three ramification regimes whose parameters [n,k,d] meet or approach the Goppa designed distance.

Significance. If the central claims are correct, the work would meaningfully expand the range of function fields usable for LCP AG codes by removing the total-ramification restriction of prior constructions. The explicit families and the shift to Galois-invariant techniques constitute a concrete methodological advance that could improve flexibility in cryptographic code design.

major comments (2)
  1. [§3] §3 (statement and proof of the necessary-and-sufficient conditions): the argument that every Galois-orbit-invariant divisor D of degree g or g-1 is automatically non-special does not address the possible linear-equivalence obstruction D ∼ K when the λ_i are mixed; the different (and hence the canonical class) depends explicitly on the λ_i, so an extra relation could appear precisely in the mixed-ramification case and falsify the “no constraint on support” claim.
  2. [§5] §5 (explicit constructions in the three regimes): the parameters [n,k,d] are asserted to meet or approach the Goppa bound, yet the minimum-distance verification is not supplied for the new families; without an explicit computation or bound that accounts for the arbitrary λ_i, the distance claim remains unverified.
minor comments (2)
  1. [title] The title contains the typo “Arbritary”; correct to “Arbitrary”.
  2. [§2] The notation for the ramification tuple (λ_1,…,λ_r) is introduced without a concrete low-genus example; adding one in §2 would clarify the three regimes.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We are grateful to the referee for the thorough review and insightful comments. Below we provide point-by-point responses to the major comments.

read point-by-point responses
  1. Referee: [§3] §3 (statement and proof of the necessary-and-sufficient conditions): the argument that every Galois-orbit-invariant divisor D of degree g or g-1 is automatically non-special does not address the possible linear-equivalence obstruction D ∼ K when the λ_i are mixed; the different (and hence the canonical class) depends explicitly on the λ_i, so an extra relation could appear precisely in the mixed-ramification case and falsify the “no constraint on support” claim.

    Authors: We thank the referee for this careful observation. Our argument in §3 relies on the fact that for Galois-invariant divisors of degree g or g-1, the space L(D) has dimension 1 or 0 respectively by direct counting of the invariant functions using the group action, without reference to the canonical class. Nevertheless, to rule out any possible linear equivalence to K in the mixed λ_i case, we will add an explicit check using the formula for the different divisor, which shows that K has a different valuation profile. This will be incorporated as a remark in the revised §3. revision: partial

  2. Referee: [§5] §5 (explicit constructions in the three regimes): the parameters [n,k,d] are asserted to meet or approach the Goppa bound, yet the minimum-distance verification is not supplied for the new families; without an explicit computation or bound that accounts for the arbitrary λ_i, the distance claim remains unverified.

    Authors: The referee correctly notes that the minimum-distance verification is not fully detailed. We will revise §5 to include an explicit bound on the minimum distance for the constructed codes, derived from the properties of the non-special divisors and accounting for the arbitrary ramification indices λ_i. This will confirm that the parameters meet or approach the Goppa bound in each regime. revision: yes

Circularity Check

0 steps flagged

No circularity: derivation uses independent Galois action on places to certify non-speciality

full rationale

The paper derives necessary and sufficient conditions for non-special divisors directly from the action of the Galois group on places above the branch points in the Kummer cover y^m = ∏(x−α_i)^λ_i. The canonical divisor is fixed by the different (determined by the λ_i), and orbit-invariant divisors are checked against linear equivalence to K or 0 using standard Riemann-Roch and class-group facts. No step defines the non-speciality predicate in terms of itself, renames a fitted quantity as a prediction, or reduces the central claim to a self-citation whose content is unverified. The three ramification regimes are handled by explicit orbit computations that remain independent of the target l(D) values.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The framework relies on standard algebraic geometry over finite fields and Galois theory for Kummer extensions; no new free parameters or invented entities are introduced in the abstract description.

axioms (2)
  • standard math Riemann-Roch theorem applies to divisors on the Kummer cover to determine speciality
    Implicit in the definition and use of non-special divisors of degree g and g-1
  • domain assumption Galois group actions preserve the relevant divisor classes and ramification data
    Central to the invariant divisor technique described

pith-pipeline@v0.9.0 · 5512 in / 1274 out tokens · 47395 ms · 2026-05-15T02:33:53.226515+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

16 extracted references · 16 canonical work pages · 1 internal anchor

  1. [1]

    On the existence of non-special divisors of degreegandg−1 in algebraic function fields overF q,

    S. Ballet and D. Le Brigand, “On the existence of non-special divisors of degreegandg−1 in algebraic function fields overF q,”Journal of Number Theory,vol. 116, no. 2, pp. 293–310, 2006

  2. [2]

    On linear complementary pairs of algebraic geometry codes over finite fields,

    S. Bhowmick, D. K. Dalai, and S. Mesnager, “On linear complementary pairs of algebraic geometry codes over finite fields,”Discrete Math.,vol. 347, no. 12, pp. 114193, 2024

  3. [3]

    On linear complementary pairs of codes,

    C. Carlet, C. G¨ uneri, F. ¨Ozbudak, B. ¨Ozkaya, and P. Sol´ e, “On linear complementary pairs of codes,”IEEE Trans. Inf. Theory,vol. 64, no. 10, pp. 6583–6589, 2018

  4. [4]

    Linear complementary dual codes and linear complementary pairs of AG codes in function fields,

    A. S. Castellanos, A. V. Marques, and L. Quoos, “Linear complementary dual codes and linear complementary pairs of AG codes in function fields,”IEEE Trans. Inf. Theory,vol. 71, no. 3, pp. 1676–1688, 2025

  5. [5]

    On generalized Weierstrass Semigroups in arbi- trary Kummer extensions ofF q(x),

    A. S. Castellanos, E. Mendoza, and G. Tizziotti, “On generalized Weierstrass Semigroups in arbi- trary Kummer extensions ofF q(x),”Finite Fields Appl.,vol. 112, p. 102808, 2026

  6. [6]

    Codes on algebraic curves,

    V. D. Goppa, “Codes on algebraic curves,”Dokl. Akad. Nauk SSSR,vol. 259, no. 6, pp. 1289–1290, 1981

  7. [7]

    Linear complementary pairs of algebraic geometry codes via Kummer extensions,

    J. Huang, H. Chen, H. Zhang, and C.-A. Zhao, “Linear complementary pairs of algebraic geometry codes via Kummer extensions,”arXiv preprint arXiv:2506.23081, 2025

  8. [8]

    On maximal curves related to Chebyshev polynomi- als,

    A. Kazemifard, S. Tafazolian, and F. Torres, “On maximal curves related to Chebyshev polynomi- als,”Finite Fields Appl.,vol. 52, pp. 200–213, 2018

  9. [9]

    Code construction on fiber products of Kummer covers,

    H. Maharaj, “Code construction on fiber products of Kummer covers,”IEEE Trans. Inf. Theory, vol. 50, no. 9, pp. 2169–2173, 2004

  10. [10]

    Linear codes with complementary duals,

    J. L. Massey, “Linear codes with complementary duals,”Discrete Math.,vol. 106–107, pp. 337–342, 1992

  11. [11]

    Characterization of non-special divisors of small degree on Kummer extensions and LCP codes

    E. Mendoza, H. Navarro, and L. Quoos, “Characterization of non-special divisors of small degree on Kummer extensions and LCP codes,”arXiv preprint arXiv:2604.27146, 2026. 26 ADLER MARQUES, YURI DA SIL V A, AND SAEED TAF AZOLIAN

  12. [12]

    Explicit non-special divisors of small degree, alge- braic geometric hulls, and LCD codes from Kummer extensions,

    E. C. Moreno, H. H. Lopez, and G. L. Matthews, “Explicit non-special divisors of small degree, alge- braic geometric hulls, and LCD codes from Kummer extensions,”SIAM J. Appl. Algebra Geometry, vol. 8, no. 2, pp. 394–413, 2024

  13. [13]

    Stichtenoth,Algebraic Function Fields and Codes, Graduate Texts in Mathematics,vol

    H. Stichtenoth,Algebraic Function Fields and Codes, Graduate Texts in Mathematics,vol. 254, 2nd ed. Springer-Verlag, Berlin, 2009

  14. [14]

    On certain maximal hyperelliptic curves related to Chebyshev polyno- mials,

    S. Tafazolian and J. Top, “ On certain maximal hyperelliptic curves related to Chebyshev polyno- mials,”J. Number Theoryvol. 203, pp. 276–293, 2019

  15. [15]

    On the curvey n =x ℓ(xm + 1) over finite fields,

    S. Tafazolian and F. Torres, “On the curvey n =x ℓ(xm + 1) over finite fields,”Adv. Geom.,vol. 19, pp. 263–268, 2019

  16. [16]

    Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound,

    M. A. Tsfasman, S. G. Vl˘ adut ¸, and T. Zink, “Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound,”Math. Nachr.,vol. 109, pp. 21–28, 1982. Universidade Federal do Rio de Janeiro – Instituto de Matem ´atica, Cidade Univer- sit´aria, CEP 21941-909, Rio de Janeiro, Brazil Email address:adler@im.ufrj.br Departamento de Matem...