pith. sign in

arxiv: 2605.23221 · v1 · pith:PSX4ANYDnew · submitted 2026-05-22 · 🧮 math.AG · math.CO

Functional codes arising from rank n Hermitian varieties and hypersurfaces in low dimensions

Subrata Manna This is my paper

Pith reviewed 2026-05-25 03:53 UTC · model grok-4.3

classification 🧮 math.AG math.CO
keywords Hermitian varietiesfunctional codesrational pointshypersurfacesprojective spacefinite fieldscode parametersminimum distance
0
0 comments X

The pith

An upper bound on rational points in intersections of degenerate Hermitian varieties with degree-at-most-q hypersurfaces determines the parameters of the associated functional codes for n=2,3,4.

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

The paper examines functional codes defined by evaluating degree-d polynomials on the rational points of a rank-n degenerate Hermitian variety inside projective n-space over a finite field of square order. It proves an upper bound on the largest possible number of rational points in the intersection of this variety with any hypersurface of degree at most q. The bound is then applied to compute the exact length, dimension, and minimum distance of the codes when the ambient dimension n equals 2, 3, or 4. The hypersurfaces that realize the minimum distance are characterized in these low-dimensional cases. These parameters matter because they fix the error-detection and correction properties of the codes.

Core claim

We establish an upper bound for the maximum number of F_{q^2}-rational points in the intersection of P U_{n-1} with an F_{q^2}-hypersurface of degree at most q in P^n. Using this bound, we determine the parameters of the codes C_d(P U_{n-1}) in the cases n=2,3,4. We also characterize the hypersurfaces that correspond to the minimum distance of these codes in the cases n=2,3,4.

What carries the argument

The functional code C_d(P U_{n-1}) formed by evaluating degree-d polynomials (d ≤ q) at the F_{q^2}-points of the degenerate Hermitian variety P U_{n-1}, with the intersection-size bound serving as the device that fixes the minimum distance.

If this is right

  • The length, dimension, and minimum distance of C_d(P U_{n-1}) are obtained explicitly for n=2,3,4 and all d ≤ q.
  • Minimum-distance codewords arise precisely from the hypersurfaces characterized in the paper.
  • The weight distribution of the codes is thereby fixed in these dimensions.
  • The same bound controls the maximum intersection size for any hypersurface of degree ≤ q.

Where Pith is reading between the lines

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

  • If a comparable bound can be proved for n>4, the same method would yield code parameters in higher dimensions.
  • The explicit characterization of minimum-distance hypersurfaces supplies concrete constructions that could be compared with other known optimal codes in the same ambient spaces.

Load-bearing premise

The stated upper bound on the maximum number of rational points holds for every hypersurface of degree at most q.

What would settle it

An explicit hypersurface of degree at most q whose intersection with P U_{n-1} contains strictly more F_{q^2}-points than the bound permits, for any n in {2,3,4} and any q, would falsify the bound and the derived code parameters.

read the original abstract

We study the functional code $C_d(\mathcal{X})$, introduced by G. Lachaud in 1996, in the case where $\mathcal{X}$ is a rank $n$ degenerate Hermitian variety $P\mathcal{U}_{n-1}$ in $\mathbb{P}^n(\mathbb{F}_{q^2})$ and $d\leq q$. We establish an upper bound for the maximum number of $\mathbb{F}_{q^2}$-rational points in the intersection of $P\mathcal{U}_{n-1}$ with an $\mathbb{F}_{q^2}$-hypersurface of degree at most $q$ in $\mathbb{P}^n$. Using this bound, we determine the parameters of the codes $C_d(P\mathcal{U}_{n-1})$ in the cases $n=2,3,4$. We also characterize the hypersurfaces that correspond to the minimum distance of these codes in the cases $n=2,3,4$.

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

0 major / 4 minor

Summary. The paper studies functional codes C_d(X) where X = P U_{n-1} is the rank-n degenerate Hermitian variety in P^n(F_{q^2}), for d ≤ q. It establishes an upper bound on the maximum number of F_{q^2}-rational points in the intersection of P U_{n-1} with any F_{q^2}-hypersurface of degree at most q, then uses the bound to determine the exact parameters [n, k, d] of the codes C_d(P U_{n-1}) for n = 2, 3, 4 and to characterize the hypersurfaces achieving minimum distance in these cases.

Significance. If the stated upper bound holds, the work supplies explicit, computable parameters for a family of functional codes arising from Hermitian varieties in low-dimensional projective spaces. This is a concrete contribution to algebraic coding theory over finite fields, particularly for the Lachaud functional-code construction, and the geometric characterization of minimum-weight codewords adds a useful structural result.

minor comments (4)
  1. §1 (Introduction): the notation P U_{n-1} is introduced without an explicit reference to the defining equation of the rank-n Hermitian variety; a one-line reminder of the quadratic form would improve readability for readers outside the immediate subfield.
  2. Theorem 3.2 (the main bound): the statement is given for hypersurfaces of degree ≤ q, but the proof sketch in §3.3 appears to treat the homogeneous case separately from the inhomogeneous case; a short clarifying sentence on how the two cases are reduced would help.
  3. Table 1 (parameters for n=2,3,4): the column headings use C_d without repeating the ambient space; adding “over P U_{n-1}” once in the caption would avoid any ambiguity when the table is read in isolation.
  4. §4.1 (n=2 case): the characterization of minimum-distance hypersurfaces is stated as “the union of q+1 lines through a point”; it would be helpful to confirm whether this is up to projective equivalence or whether all such unions achieve the bound.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive assessment of the manuscript and the recommendation of minor revision. The report summarizes our results on functional codes from rank-n degenerate Hermitian varieties but lists no specific major comments. We are happy to make any minor editorial adjustments in the revised version.

Circularity Check

0 steps flagged

No significant circularity

full rationale

The derivation proceeds by proving an upper bound on F_{q^2}-points in intersections of the degenerate Hermitian variety with hypersurfaces of degree ≤ q via geometric counting in projective space over finite fields, then directly applies that bound to obtain exact code parameters for n=2,3,4. No step reduces a claimed result to a fitted parameter, self-citation, or input by construction; the bound is obtained independently of the target code weights and the argument chain remains self-contained against external geometric facts.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Only the abstract is available; no explicit free parameters, axioms, or invented entities are stated.

pith-pipeline@v0.9.0 · 5690 in / 1063 out tokens · 23248 ms · 2026-05-25T03:53:20.725899+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

26 extracted references · 26 canonical work pages

  1. [1]

    Bartoli, M

    D. Bartoli, M. De Boeck, S. Fanali and L. Storme, On the functional codes defined by quadrics and Hermitian varieties.Des. Codes Cryptogr.71(2014), no.1, 21–46

    work page 2014

  2. [2]

    Beelen and M

    P. Beelen and M. Datta, Maximum number of points on intersection of a cubic surface and a non-degenerate hermitian surface.Moscow Math. J.,20(2020), 453–474

    work page 2020

  3. [3]

    Beelen, M

    P. Beelen, M. Datta and M. Homma, A proof of sørensen’s conjecture on hermitian surfaces.Proc. Amer. Math. Soc.149(2021), 1431–1441

    work page 2021

  4. [4]

    Beelen, M

    P. Beelen, M. Datta, M. Montanucci, and J. Niemann. Intersection of irreducible curves and the Hermitian curve.J. Algebra671(2025), 75-94

    work page 2025

  5. [5]

    Bose and I.M

    R.C. Bose and I.M. Chakravarti, Hermitian varieties in a finite projective spaceP G(N, q 2).Canad. J. Math.18(1966), 1161 – 1182

    work page 1966

  6. [6]

    I.M. Chakravarti, Some properties and applications of Hermitian varieties in a finite projective space P G(N, q2) in the construction of strongly regular graphs (two-class association schemes) and block designs. J. Combinatorial Theory Ser. B11(1971), 268 – 283

    work page 1971

  7. [7]

    Datta, Maximum number ofF q-rational points on nonsingular threefolds inP 4.Finite Fields Appl.59, (2019), 86–96

    M. Datta, Maximum number ofF q-rational points on nonsingular threefolds inP 4.Finite Fields Appl.59, (2019), 86–96

    work page 2019

  8. [8]

    Datta and S.R

    M. Datta and S.R. Ghorpade, Remarks on the Tsfasman-Boguslavsky Conjecture and higher weights of projective Reed-Muller codes. Arithmetic, geometry, cryptography and coding theory, 157–169,Contemp. Math.,686, Amer. Math. Soc., Providence, RI, 2017

    work page 2017

  9. [9]

    Datta and S

    M. Datta and S. Manna, Maximum number of points on an intersection of a cubic threefold and a non- degenerate Hermitian threefold.Finite Fields Appl.98(2024), Paper No. 102462, 23 pp

    work page 2024

  10. [10]

    Edoukou, Codes defined by forms of degree 2 on Hermitian surfaces and Sørensen’s conjecture

    F.A.B. Edoukou, Codes defined by forms of degree 2 on Hermitian surfaces and Sørensen’s conjecture. Finite Fields Appl.13 (2007), no. 3, 616 – 627. 17

    work page 2007

  11. [11]

    F. A. B. Edoukou. Codes defined by forms of degree 2 on quadric surfaces.IEEE Trans. Inform. Theory. 54(2008), no. 2, 860–864

    work page 2008

  12. [12]

    F.A.B. Edoukou. Codes defined by forms of degree 2 on non-degenerate Hermitian varieties inP 4(Fq2). Des. Codes Cryptogr.50 (2009), no. 1, 135–146

    work page 2009

  13. [13]

    F.A.B. Edoukou. The weight distribution of the functional codes defined by forms of degree 2 on Hermitian surfaces.J. Th´ eor. Nombres Bordeaux.21(2009), no. 1, 131–143

    work page 2009

  14. [14]

    F. A. B. Edoukou, A. Hallez, F. Rodier, and L. Storme. The small weight codewords of the functional codes associated to nonsingular Hermitian varieties.Des. Codes Cryptogr.56(2010), no. 2-3, 219–233

    work page 2010

  15. [15]

    F. A. B. Edoukou, A. Hallez, F. Rodier, and L. Storme. A study of intersections of quadrics having applications on the small weight codewords of the functional codesC 2(Q),Qa nonsingular quadric.J. Pure Appl. Algebra.214(2010), no. 10, 1729–1739

    work page 2010

  16. [16]

    Edoukou, S

    F.A.B. Edoukou, S. Ling and C. Xing. Structure of functional codes defined on non-degenerate Hermitian varieties.J. Combin. Theory A.118, 2436–2444(2011)

    work page 2011

  17. [17]

    Ghorpade and R

    S.R. Ghorpade and R. Ludhani, On the minimum distance, minimum weight codewords, and the dimension of projective Reed-Muller codes.Adv. Math. Commun.18(2024), no. 2, 360–382

    work page 2024

  18. [18]

    Hallez and L

    A. Hallez and L. Storme, Functional code arising from quadric intersections with Hermitian varieties, Finite Fields Appl.16(2010) 27–35

    work page 2010

  19. [19]

    Harris, Algebraic geometry

    J. Harris, Algebraic geometry. A first course. Graduate Texts in Mathematics, 133. Springer-Verlag, New York, 1992

    work page 1992

  20. [20]

    Lachaud, Number of points of plane sections and linear codes defined on algebraic varieties

    G. Lachaud, Number of points of plane sections and linear codes defined on algebraic varieties. (English summary)Arithmetic, geometry and coding theory (Luminy, 1993), 77 –104, de Gruyter, Berlin, 1996

    work page 1993

  21. [21]

    Lachaud and R

    G. Lachaud and R. Rolland, On the number of points of algebraic sets over finite fields.J. Pure Appl. Algebra219 (2015), no. 11, 5117 – 5136

    work page 2015

  22. [22]

    J. B. Little, Algebraic geometry codes from higher dimensional varieties. In: Advances in Algebraic Ge- ometry Codes, pp. 257–293. World Scientific, Singapore (2008)

    work page 2008

  23. [23]

    Serre, Lettre ` a M

    J.-P. Serre, Lettre ` a M. Tsfasman (French, with English summary),Journ´ ees Arithm´ etiques, 1989 (Luminy, 1989), Ast´ erisque 198 –200 (1991), 11, 351–353 (1992)

    work page 1989

  24. [24]

    Manna, Maximum number of points of intersection of a non-degenerate Hermitian variety and a cubic hypersurface.Des

    S. Manna, Maximum number of points of intersection of a non-degenerate Hermitian variety and a cubic hypersurface.Des. Codes Cryptogr.94, 31 (2026)

    work page 2026

  25. [25]

    Sørensen, Projective Reed-Muller codes,IEEE Trans

    A.B. Sørensen, Projective Reed-Muller codes,IEEE Trans. Inform. Theory37(1991), no. 6, 1567–1576

    work page 1991

  26. [26]

    Sørensen, Rational points on hypersurfaces, Reed–Muller codes and algebraic-geometric codes, Ph.D

    A.B. Sørensen, Rational points on hypersurfaces, Reed–Muller codes and algebraic-geometric codes, Ph.D. thesis, Aarhus, Denmark, 1991. Department of Mathematics Indian Institute of Technology Bombay, Mumbai, India Email address:subrata147314@gmail.com

    work page 1991