Pith. sign in

REVIEW 3 major objections 5 minor 1 cited by

Combinatorial $t$-Designs from Finite Abelian Groups and Their Applications to Elliptic Curve Codes

T0 review · 3 major / 5 minor · reviewed 2026-08-07 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read The paper gives a complete necessary and sufficient condition for when the collection of k-subsets of a finite abelian p-group summing to a fixed element x forms a 1-design, and it characterizes the parallel case for groups of exponent pq.

desk verdict The p-group characterization is a solid, publishable advance, but the exponent-pq theorem rests on incorrect torsion counts and should be repaired or removed before it is accepted. read the letter →

arxiv 2506.00429 v1 pith:YA3NBAZJ submitted 2025-05-31 math.CO cs.ITmath.IT

Hengfeng Liu , Chunming Tang , Cuiling Fan , Rong Luo This is my paper
classification math.COcs.ITmath.IT MSC 05B0594B05
keywords subsetsumst-designsfiniteabeliangroupsp-groups1-designsellipticcurvecodesNMDSincidencestructures
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

This paper answers the question: for a finite abelian group and a fixed element x, when does the family of all k-element subsets with sum exactly x form a 1-design? It fully determines the answer for every finite abelian p-group, giving a condition in terms of the exponent of the group, the p-adic valuation of k, and the coordinates of x, and it also gives a characterization for groups whose exponent is a product of two distinct primes. The elementary abelian p-group case studied earlier emerges as a special case, so the work is a genuine generalization. A final section connects these combinatorial designs to elliptic curve codes, showing that when the group is the rational point group of an elliptic curve, subset-sum designs support the minimum-weight codewords of NMDS codes derived from the curve.

What carries the argument

The load-bearing mechanism is the reduction of the 1-design condition to constancy of subset-sum counts. For each point $y$, translation by $-y$ gives a bijection between the blocks of $B_x^k$ containing $y$ and the $(k-1)$-subsets of $G \setminus \{0\}$ summing to $x - ky$, so $(G, B_x^k)$ is a 1-design exactly when $y \mapsto b_{k-1}^{x-ky,*}$ is constant. This constancy is decided through the closed form in Theorem 2.2 for the number of $k$-subsets of a finite abelian group summing to a given element, a Möbius-inversion sum over the divisors of the exponent that is weighted by the sizes of the torsion subgroups $G[d]$. In the p-group case the formulas are controlled by the invariant $e(x) = \max\{d : d \mid \exp(G), x \in dG\}$, which is then expressed in terms of the p-adic valuations of the coordinates of $x$ and of $k$.

What would settle it

Take a concrete group of exponent $pq$, for instance $G = \mathbb{Z}_2 \oplus \mathbb{Z}_6$, and for each $k$ between $2$ and $|G|-1$ compute the values $b_{k-1}^{g,*}$ for each $e$-class of $g$ using the closed form of Theorem 2.2. If the computed equalities do not match the assertions of Lemma 4.1, the lemma is false and Theorem 4.2 collapses; a systematic match across many small groups would confirm the characterization.

Watch

Extended reading notes

Core claim

The central discovery is a full 1-design classification. For an odd prime p and $G \cong \mathbb{Z}_{p^{t_1}} \oplus \cdots \oplus \mathbb{Z}_{p^{t_m}}$, the paper proves that $(G, B_x^k)$ is a 1-design if and only if $p \mid k$ and one of three conditions holds: (i) $p^{t_m} \mid k$, with the caveat that when $k = n$ the only admissible $x$ is $0$; (ii) at least one coordinate of $x$ is not divisible by $p$; or (iii) all coordinates of $x$ are divisible by $p$ and $\max_i\{\nu_p(k) - \nu_i^p(x_i)\} \geq 1$. The proof reduces the design condition to the constancy of a family of subset-sum counts and then evaluates those counts using the closed formula of Theorem 2.2. For groups of exponent $pq$, Theorem 4.2 provides a corresponding list of conditions, expressed through divisibility of $k$ by $p$ or $q$, the divisibility pattern of the coordinates of $x$, and explicit binomial-coefficient equations. The results for the elementary abelian p-group case of [21] follow directly.

Load-bearing premise

The exponent-$pq$ characterization rests on Lemma 4.1, whose proof uses torsion-subgroup counts such as $q^t$ and $p^{t+s}$ for the group $G \cong \mathbb{Z}_p^s \oplus \mathbb{Z}_{pq}^{t-s}$ without a derivation; if those counts are wrong, conditions (iv) and (v) of Theorem 4.2 do not follow.

Editorial extensions

If this is right

  • For any finite abelian p-group the design question is settled by a checkable arithmetic condition on the coordinates of $x$ and the p-adic valuation of $k$.
  • The known characterization for elementary abelian p-groups from [21] is recovered as the special case where every invariant factor is $\mathbb{Z}_p$.
  • For groups of exponent $pq$, the design property reduces to divisibility conditions on $k$ combined with explicit binomial-coefficient equations that can be evaluated directly.
  • With the rational point group of an elliptic curve in hand, the correspondence of Proposition 6.2 turns any such subset-sum 1-design into an NMDS elliptic curve code whose minimum-weight codewords support a 1-design.
  • Theorem 5.3 shows that when the exponent divides $k$, a $(t+1)$-design on the whole group $(G, B_k)$ descends to a $t$-design on the nonzero points $(G^*, B_k^*)$, so the elliptic curve code application carries to every order $t$.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Should Conjecture 3.8 hold, non-elementary abelian p-groups would admit no 2-designs from subset sums at all, making the 1-design classification the complete answer for those groups.
  • The binomial-ratio symmetry $f(n,k) = f(n,n+1-k)$ used in Lemma 4.1 suggests a path to the cyclic-group open problem, which the paper states but does not resolve; analyzing this ratio with Legendre-type valuations could settle it.
  • The translation-reduction method of Lemma 3.1 is not confined to abelian groups: any group with a closed formula for subset-sum counts would yield an analogous 1-design criterion, so the approach could extend to non-abelian or three-prime-exponent settings.
  • The code-design pipeline could be run in reverse as a construction engine: searching over elliptic curves whose rational point group has a design-supporting subset-sum structure would systematically produce NMDS codes holding designs.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 5 minor

Summary. The paper studies the incidence structures (G, B_x^k), where G is a finite abelian group and B_x^k is the family of all k-subsets of G summing to an element x. It claims a full characterization of the parameters (k, x) for which these structures are 1-designs when G is a finite abelian p-group (Theorem 3.3, Proposition 3.4), and an analogous characterization when G is a finite abelian group of exponent pq (Theorem 4.2, resting on Lemma 4.1). Additional results include observations on cyclic and non-cyclic groups (Propositions 5.1 and 5.2, Theorem 5.3), a conjecture on the nonexistence of nontrivial 2-designs in non-elementary abelian p-groups (Conjecture 3.8), and an application to NMDS elliptic curve codes whose minimum-weight codewords support designs (Proposition 6.2, Theorem 6.3, Example 6.5). The p-group section is internally coherent and correctly recovers Pavone's vector-space result, but the exponent-pq section contains a load-bearing error in the torsion-count computations, and the elliptic-curve example is numerically inconsistent.

Significance. If the p-group characterization is correct, it is a natural and useful generalization of Pavone's result for elementary abelian p-groups, and the proof via Kosters' closed formula is clean. The proposed correspondence between subset-sum designs in the group E(F_q) and support designs of minimum-weight codewords in elliptic curve codes is conceptually appealing and could yield new NMDS codes supporting designs. The paper also honestly records a conjecture and two open problems, which is appropriate for this line of work. However, the central new result for exponent-pq groups is currently unsupported because Lemma 4.1 uses incorrect torsion subgroup sizes, and the numerical example intended to demonstrate the elliptic-curve application is internally inconsistent. The significance is therefore conditional on repairing these points.

major comments (3)
  1. [Section 4, Lemma 4.1] The proof of Lemma 4.1 uses torsion subgroup sizes #G[q] = q^t and #G[p] = p^{t+s} for the group G ≅ Z_p^s ⊕ Z_pq^{t-s}. The standard sizes are #G[q] = q^{t-s} and #G[p] = p^t, with n = p^t q^{t-s}. Consequently, the displayed expressions for b^{g_1,*}_{k-1} and b^{g_2,*}_{k-1}, and the 'similarly' computation leading to Eqs. (1) and (2), do not follow from Theorem 2.2. Since Lemma 4.1 is the sole basis for Theorem 4.2, the claimed if-and-only-if characterization for exponent-pq groups is not established.
  2. [Section 4, Theorem 4.2(iv)-(v)] The proof states that conditions (iv) and (v) are 'immediately obtained by Lemma 4.1', but Lemma 4.1 only compares elements of type e=q with e=1 (part (ii)) and e=p with e=1 (part (iii)). Condition (iv) requires equality of b^{*}_{k-1} between elements of type e=p and e=pq (the zero element), and condition (v) requires equality between e=q and e=pq. No statement in Lemma 4.1 supplies these comparisons, so the derivations of conditions (iv) and (v) are not supported by the cited lemma.
  3. [Section 6, Example 6.5] The example is internally inconsistent. It states E(F_43) ≅ Z_7 ⊕ Z_7, which has 49 rational points, but then takes D = P_1 + ... + P_8 with {P_i} = E(F_7)^*, and concludes that the code has length 49 and parameters [49, k, 49-k]. If the code is constructed from E(F_43)^*, the length should be 48 and D should range over E(F_43)^*; if the curve is over F_7, the group structure and code parameters are different. As written, the example cannot verify the claimed NMDS or design properties.
minor comments (5)
  1. [Abstract] The phrase 'subset sums in finite abelian groups that supporting designs' should be 'subset sums in finite abelian groups that support designs'.
  2. [Section 5, Theorem 5.3 proof] The sentence describing the one-to-one correspondence repeats B^{x,*}_{k-1} for both families; the second occurrence should refer to B^{x,*}_k.
  3. [Section 6, Example 6.5] Even apart from the major inconsistency, the notation E(F_7)^* should be E(F_43)^* and the code length should be corrected to 48 if the intended group has order 49.
  4. [Section 3, Proposition 3.4] The definition ν_i_2(0) = 2^{t_i} is nonstandard; the convention p^∞ = 0 used elsewhere in the paper should be stated explicitly here as well.
  5. [Section 2, Theorem 2.2] The notation r^k_x(S) is defined for a set S, but later used for a single element y; the authors should clarify that r^k_x(y) means r^k_x({y}).

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity; the main theorems are derived from external closed formulas and standard group/divisor theory.

full rationale

The central derivations do not reduce to their own inputs. Section 3's characterization of 1-designs in abelian p-groups rests on Theorem 2.2, quoted from Kosters [15], together with Lemma 3.1, which is an elementary counting bijection, and Lemma 3.2, a direct comparison of the closed formulas for b^{g,*}_k and b^{*}_k. The proof of Theorem 3.3 then analyzes the variation of e(x - ky) through explicit p-adic valuations; it does not assume the design conclusion. Section 4 similarly builds on the same external formula, with Lemma 4.1 reducing the comparison of b^{g,*}_{k-1} values to binomial inequalities. The elliptic-curve application in Proposition 6.2 uses the standard divisor-theoretic identification between zero-sum subsets and functions in L(G), giving a genuine bijection rather than a renaming of the target design; Theorem 6.3 then imports the paper's own subset-sum design results only as sufficient conditions, not as the conclusion being proved. The self-citations to coding-theory papers by the same research group appear in motivational passages and in background on linear codes supporting designs; they are not used to establish the new if-and-only-if characterizations. One internal gap may exist in Lemma 4.1, where torsion counts such as q^t and p^{t+s} do not obviously match the sizes of G[q] and G[p] for G = Z_p^s ⊕ Z_{pq}^{t-s}; however, that is a correctness or rigor concern about an unstated computation, not a circular step in which an output equals an input by construction or a fitted parameter is renamed as a prediction. Under the hard rule that circularity must be exhibited by quote and explicit reduction, no circular step is present.

Assumptions & free parameters 0 free parameters · 6 assumptions · 0 invented entities

No fitted constants or invented entities appear; the paper is a structural theorem paper deriving design conditions from known closed forms, group structure, and AG-code theory.

assumptions (6)
  • standard math Kosters' closed formula for subset-sum counts (Theorem 2.2).
    Used throughout to express b_x^k and b_x^{*,k} and to show dependence only on e(x).
  • standard math Nonemptiness criterion for B_x^k (Theorem 2.3, Kosters).
    Eliminates trivial empty-block cases in Theorems 3.3, 3.4 and 4.2.
  • standard math Structure theorem for finite abelian groups.
    Represents p-groups as direct sums of cyclic p-power groups and exponent-pq groups as mixed sums of Z_p, Z_q and Z_pq.
  • standard math Riemann-Roch theorem and evaluation map for AG codes.
    Yields dimension and Singleton-type bounds for elliptic curve codes and drives the zero-sum/divisor correspondence in Proposition 6.2.
  • standard math Pavone's characterization of 2-designs for F_p^m (Proposition 3.7).
    Imported and used in Corollary 6.4 to derive 1-designs for codes from Z_p oplus Z_p.
  • domain assumption Elliptic curve group law and structure of rational points.
    Assumes E(F_q) is a finite abelian group of rank at most 2, so subset-sum designs apply to the group of rational points.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Combinatorial $t$-Designs from Finite Abelian Groups and Their Applications to Elliptic Curve Codes." pith.science (2026). https://pith.science/paper/YA3NBAZJ

@misc{pith2026250600429,
  author       = {Pith},
  title        = {Pith review of: Combinatorial $t$-Designs from Finite Abelian Groups and Their Applications to Elliptic Curve Codes},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/YA3NBAZJ}},
  note         = {Machine review of arXiv:2506.00429}
}
abstract

In this paper, we establish the conditions for some finite abelian groups and the family all the $k$-sets in each of them summing up to an element $x$ to form $t$-designs. We fully characterize the sufficient and necessary conditions for the incidence structures to form $1$-designs in finite abelian $p$-groups, generalizing existing results on vector spaces over finite fields. For finite abelian groups of exponent $pq$, we also propose sufficient and necessary conditions for the incidence structures to form a $1$-designs. Furthermore, some interesting observations of the general case when the group is cyclic or non-cyclic are presented and the relations between $(t-1)$-designs and $t$-designs from subset sums are established. As an application, we demonstrate the correspondence between $t$-designs from the minimum-weight codewords in elliptic curve codes and subset-sum designs in their groups of rational points. By such a correspondence, elliptic curve codes supporting designs can be simply derived from subset sums in finite abelian groups that supporting designs.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. When Do Subset Sums in Finite Abelian Groups Support $2$-Designs?

    math.CO 2026-07 accept novelty 6.0 of 10

    For any finite abelian G and any target sum x, the k-subset family summing to x is a nontrivial 2-design only if G is an elementary abelian p-group.

Reference graph

Works this paper leans on

37 extracted references · 37 canonical work pages · cited by 1 Pith paper

  1. [1]

    Cambridge University Press, Cambridge (1999)

    Beth, T., Jungnickel, D., Lenz, H.: Design Theory, 2nd edn. Cambridge University Press, Cambridge (1999)

    work page 1999

  2. [2]

    IEEE Trans

    Cheng, Q.: Hard problems of algebraic geometry codes. IEEE Trans. Inf. Theory 54(1), 402–406 (2008)

    work page 2008

  3. [3]

    Ding, C., Tang, C., Tonchev, V.D.: Linear codes of 2-designs associated with subcodes of the ternary generalized Reed-M¨ uller codes. Des. Codes Cryptogr. 88(4), 626–641 (2020)

    work page 2020

  4. [4]

    IEEE Trans

    Ding, C., Tang, C.: Infinite families of near MDS codes holding t-designs. IEEE Trans. Inf. Theory 66(9), 5419–5428 (2020)

    work page 2020

  5. [5]

    Cryptogr

    Ding, C., Tang, C.: The linear codes of t-designs held in the Reed-Muller and simplex codes. Cryptogr. Commun. 13(6), 927–949 (2021)

    work page 2021

  6. [6]

    World Scientific, Singapore (2022)

    Ding, C., Tang, C.: Designs From Linear Codes, 2nd edn. World Scientific, Singapore (2022)

    work page 2022

  7. [7]

    Finite Fields Appl

    Ding, Y., Li, Y., Zhu, S.: Four new families of NMDS codes with dimension 4 and their applications. Finite Fields Appl. 99, 102495 (2024)

    work page 2024

  8. [8]

    Delsarte, P.: Four fundamental parameters of a code and their combinatorial significance. Inf. Control 23(5), 407–438 (1973)

    work page 1973

Show all 37 references
  1. [9]

    Falcone, G., Pavone, M.: Binary Hamming codes and Boolean designs. Des. Codes Cryptogr. 89(6), 1261–1277 (2021). 18

    2021

  2. [10]

    IEEE Trans

    Han, D., Ren, Y.: A tight upper bound for the maximal length of MDS elliptic codes. IEEE Trans. Inf. Theory 69(2), 819–822 (2023)

    2023

  3. [11]

    Han, D., Ren, Y.: The maximal length of q-ary MDS elliptic codes is close to q/2. Int. Math. Res. Not. 2024(11), 9036–9043 (2024)

    2024

  4. [12]

    IEEE Trans

    Heng, Z., Li, C., Wang, X.: Constructions of MDS, near MDS and almost MDS codes from cyclic subgroups of F∗ q2 . IEEE Trans. Inf. Theory 68(12), 7817–7831 (2022)

    2022

  5. [13]

    Discrete Math

    Heng, Z., Wang, X.: New infinite families of near MDS codes holding t-designs. Discrete Math. 346(10), 113538 (2023)

    2023

  6. [14]

    Finite Fields Appl

    Heng, Z., Wang, X., Li, X.: Constructions of cyclic codes and extended primitive cyclic codes with their applications. Finite Fields Appl. 89, 102208 (2023)

    2023

  7. [15]

    Kosters, M.: The subset sum problem for finite abelian groups. J. Comb. Theory Ser. A 120(3), 527–530 (2013)

    2013

  8. [16]

    Finite Fields Appl

    Li, J., Wan, D.: On the subset sum problem over finite fields. Finite Fields Appl. 14(4), 911–929 (2008)

    2008

  9. [17]

    Li, J., Wan, D.: Counting subset sums of finite abelian groups. J. Comb. Theory Ser. A 119(1), 170–182 (2012)

    2012

  10. [18]

    In: Proc

    Li, J., Wan, D., Zhang, J.: On the minimum distance of elliptic curve codes. In: Proc. IEEE Int. Symp. Inf. Theory (ISIT), pp. 2391–2395 (2015)

    2015

  11. [19]

    Finite Fields Appl

    Li, X., Heng, Z.: Constructions of near MDS codes which are optimal locally recoverable codes. Finite Fields Appl. 88, 102184 (2023)

    2023

  12. [20]

    Springer, New York (1996)

    Nathanson, M.B.: Additive Number Theory. Springer, New York (1996)

    1996

  13. [21]

    Pavone, M.: Subset sums and block designs in a finite vector space. Des. Codes Cryptogr. 91(7), 2585–2603 (2023)

    2023

  14. [22]

    Springer, Berlin (2009)

    Stichtenoth, H.: Algebraic Function Fields and Codes. Springer, Berlin (2009)

    2009

  15. [23]

    Springer, Dordrecht (2009)

    Silverman, J.H.: The Arithmetic of Elliptic Curves, 2nd edn. Springer, Dordrecht (2009)

    2009

  16. [24]

    In: Proc

    Simos, D., Varbanov, Z.: NMDS codes and their secret-sharing schemes. In: Proc. 18th Int. Conf. Appl. Comput. Algebra (ACA’12), Sofia, Bulgaria, pp. 1–10 (2012)

    2012

  17. [25]

    IEEE Trans

    Tang, C., Ding, C., Xiong, M.: Codes, differentially δ-uniform functions, and t-designs. IEEE Trans. Inf. Theory 66(6), 3691–3703 (2020). 19

    2020

  18. [26]

    IEEE Trans

    Tang, C., Ding, C.: An infinite family of linear codes supporting 4-designs. IEEE Trans. Inf. Theory 67(1), 244–254 (2020)

    2020

  19. [27]

    Cambridge University Press, Cambridge (2006)

    Tao, T., Vu, V.: Additive Combinatorics. Cambridge University Press, Cambridge (2006)

    2006

  20. [28]

    IEEE Trans

    Wang, X., Tang, C., Ding, C.: Infinite families of cyclic and negacyclic codes supporting 3-designs. IEEE Trans. Inf. Theory 69(4), 2341–2354 (2023)

    2023

  21. [29]

    Cryptogr

    Xiang, C.: Some t-designs from BCH codes. Cryptogr. Commun. 14(3), 641–652 (2022)

    2022

  22. [30]

    Finite Fields Appl

    Xiang, C., Tang, C.: Some 3-designs and shortened codes from binary cyclic codes with three zeros. Finite Fields Appl. 89, 102201 (2023)

    2023

  23. [31]

    IEEE Trans

    Xu, G., Cao, X., Qu, L.: Infinite families of 3-designs and 2-designs from almost MDS codes. IEEE Trans. Inf. Theory 68(7), 4344–4353 (2022)

    2022

  24. [32]

    Discrete Math

    Xu, L., Fan, C.: Near MDS codes of non-elliptic-curve type from Reed-Solomon codes. Discrete Math. 346(9), 113490 (2023)

    2023

  25. [33]

    Finite Fields Appl

    Xu, L., Fan, C., Han, D.: Near-MDS codes from maximal arcs in PG(2 , q). Finite Fields Appl. 93, 102338 (2024)

    2024

  26. [34]

    Yan, H., Yin, Y.: On the parameters of extended primitive cyclic codes and the related designs. Des. Codes Cryptogr. 92(6), 1533–1540 (2024)

    2024

  27. [35]

    Yin, Y., Yan, H.: Constructions of several families of MDS codes and NMDS codes. Adv. Math. Commun. 19(4), 1222-1247 (2024)

    2024

  28. [36]

    Discrete Math

    Zhi, Y., Zhu, S.: New MDS codes of non-GRS type and NMDS codes. Discrete Math. 348(5), 114436 (2025)

    2025

  29. [37]

    IEEE Trans

    Zhuang, J., Cheng, Q., Li, J.: On determining deep holes of generalized Reed- Solomon codes. IEEE Trans. Inf. Theory 62(1), 199–207 (2016). 20

    2016

Pith tools

Reviewed August 7, 2026 · model on record in the stance chip above.