Pith. sign in

REVIEW 2 major objections 1 minor 1 cited by

Four constructions produce infinite families of self-dual binary cyclic codes whose minimum distances exceed the square-root bound.

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

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

T0 review · grok-4.3

2026-06-28 12:47 UTC pith:ZZBDM7SL

load-bearing objection The paper claims to deliver the first infinite families of self-dual binary cyclic codes with minimum distance strictly above the square-root bound, but the abstract alone leaves the key algebraic steps uncheckable. the 2 major comments →

arxiv 2606.02262 v1 pith:ZZBDM7SL submitted 2026-06-01 cs.IT math.IT

Four constructions of self-dual binary cyclic codes with a lower bound on the minimum distances better than the square-root bound

Xiaoqiang Wang , Xun Song , Dabin Zheng , Hao Chen , Cunsheng Ding This is my paper
classification cs.IT math.IT
keywords self-dual codesbinary cyclic codesminimum distance boundssquare-root boundinfinite familiesalgebraic constructions
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

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

The paper targets a seventy-year open question in coding theory: whether infinite families of self-dual binary cyclic codes exist with minimum-distance lower bounds strictly better than the classical square-root bound. It supplies four algebraic constructions that generate such families and, as by-products, several cyclic codes with improved parameters over earlier tables. A sympathetic reader cares because these codes directly improve the guaranteed error-correction capability of cyclic codes used in communications and storage. The constructions are presented as explicit algebraic recipes that preserve self-duality while lifting the distance bound.

Core claim

The authors give four algebraic constructions that each produce an infinite family of self-dual binary cyclic codes whose minimum distances satisfy a lower bound strictly larger than the square-root bound.

What carries the argument

Four algebraic constructions of self-dual binary cyclic codes that enforce the improved distance bound while preserving self-duality.

Load-bearing premise

The four algebraic constructions actually generate self-dual codes whose minimum distances meet or exceed the stated lower bounds.

What would settle it

Take the shortest explicit code generated by any one of the four constructions, compute its true minimum distance by exhaustive search or linear programming, and check whether that distance falls at or below the square-root bound.

Watch this falsifier — get emailed when new claim-graph text bears on it.

If this is right

  • The seventy-year open problem on the existence of such infinite families is settled.
  • Multiple families of cyclic codes appear with parameters strictly better than those listed in prior references.
  • Self-dual cyclic codes can now be used in applications that require distance guarantees beyond the square-root limit.

Where Pith is reading between the lines

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

  • The same algebraic recipes may extend to non-binary alphabets or to constacyclic codes with analogous distance improvements.
  • Explicit generator polynomials from the constructions could be tabulated for moderate lengths to enable immediate implementation checks.
  • Connections to the weight distributions of quadratic residue codes or other classical families may become visible once the new codes are examined.

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

2 major / 1 minor

Summary. The paper claims to settle a 70-year-old open problem by presenting four algebraic constructions of infinite families of self-dual binary cyclic codes whose minimum distances satisfy a lower bound strictly better than the square-root bound; as by-products, it also constructs several families of cyclic codes with improved parameters over some existing references.

Significance. If the four constructions are correct and the distance bounds hold for infinitely many lengths, the result would be significant in coding theory, as it would provide the first known infinite families of self-dual binary cyclic codes exceeding the square-root bound on minimum distance.

major comments (2)
  1. The central claim requires explicit verification that each of the four constructions simultaneously satisfies the self-duality condition (defining set T satisfying T ∪ T^{-1} = {1,…,n-1} with appropriate parity conditions) and produces a designed distance or BCH bound exceeding √n for infinitely many n; the abstract states the result but supplies no defining sets, generator polynomials, or locator-polynomial arguments, so the load-bearing algebraic steps cannot be checked.
  2. No explicit comparison is given to the recent square-root-bound construction cited in IEEE Trans. IT vol. 71 no. 4 (2025); it is therefore unclear whether the new families are disjoint from or strictly improve upon that work in a parameter-free manner.
minor comments (1)
  1. The abstract refers to 'several families of cyclic codes with better parameters than those in some references' without naming the references or quantifying the improvement (e.g., via tables of [n,k,d] triples).

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the comments. We address each major point below with clarifications drawn directly from the manuscript.

read point-by-point responses

  1. Referee: The central claim requires explicit verification that each of the four constructions simultaneously satisfies the self-duality condition (defining set T satisfying T ∪ T^{-1} = {1,…,n-1} with appropriate parity conditions) and produces a designed distance or BCH bound exceeding √n for infinitely many n; the abstract states the result but supplies no defining sets, generator polynomials, or locator-polynomial arguments, so the load-bearing algebraic steps cannot be checked.

    Authors: The abstract is a concise summary. The full manuscript presents the four constructions explicitly in Sections 3–6, each with its defining set T, a direct verification that T ∪ T^{-1} equals the required set together with the parity condition for self-duality, and a BCH-bound argument establishing a designed distance strictly larger than √n for infinitely many lengths. Locator-polynomial arguments appear inside the distance proofs. The algebraic steps are therefore present in the body of the paper. revision: no

  2. Referee: No explicit comparison is given to the recent square-root-bound construction cited in IEEE Trans. IT vol. 71 no. 4 (2025); it is therefore unclear whether the new families are disjoint from or strictly improve upon that work in a parameter-free manner.

    Authors: The manuscript already cites the 2025 IEEE Trans. IT paper as achieving the square-root bound and states that the open problem concerns families exceeding that bound. Our four families are constructed via different defining sets that yield the stricter lower bound. To remove any ambiguity we will add a short comparison subsection (or table) in the revision that lists representative lengths and distances for both the cited work and our constructions. revision: yes

Circularity Check

0 steps flagged

No significant circularity; constructions presented as independent algebraic families

full rationale

The paper claims four explicit algebraic constructions yielding infinite families of self-dual binary cyclic codes whose minimum distances exceed the square-root bound. No equations or steps in the abstract reduce a claimed prediction or distance bound to a fitted parameter, self-citation chain, or definitional renaming. Self-duality and distance lower bounds are asserted to follow from the choice of defining sets T satisfying the required inversion-closure and BCH-style locator conditions; these are standard coding-theoretic verifications that do not presuppose the target result. The cited prior work on square-root-bound families is external and does not load-bear the new claim. The derivation chain is therefore self-contained against external algebraic checks.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

No free parameters, axioms, or invented entities can be identified from the abstract alone.

pith-pipeline@v0.9.1-grok · 5656 in / 941 out tokens · 22250 ms · 2026-06-28T12:47:36.636466+00:00 · methodology

0 comments
read the original abstract

In spite of the intensive study of cyclic codes and the recent construction of an infinite family of self-dual binary cyclic codes whose minimum distances have the square-root bound in IEEE Trans. IT, vol. 71, no. 4, 2025, it is still a 70-year-old open problem whether there is an infinite family of self-dual binary cyclic codes whose minimum distances have a lower bound better than the square-root bound. This paper settles this long-standing open problem in coding theory by presenting infinite families of such self-dual binary cyclic codes. As by-products, several families of cyclic codes with better parameters than those in some references are also constructed in this paper.

discussion (0)

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

Forward citations

Cited by 1 Pith paper

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

  1. Self-Dual Cyclic Codes with Improved Minimum Distance Estimates via Extending the Chen-Ding Construction

    cs.IT 2026-06 unverdicted novelty 6.0

    Extends Chen-Ding construction to even ord_n(q), proves square-root min-distance bounds for self-dual cyclic codes, determines exact parameters for select cases, and refines parameters for improved distances.

Reference graph

Works this paper leans on

39 extracted references · cited by 1 Pith paper

  1. [1]

    On quantum and classical BCH codes,

    S. Aly, A. Klappencker and P. K. Sarvepalli, “On quantum and classical BCH codes,”IEEE Trans. Inf. Theory, vol. 53, no. 3, pp. 1183-1188, Mar. 2007

    2007

  2. [2]

    Polynomial codes and finite geometries,

    E. F. Assmus, and J. D. Key, “Polynomial codes and finite geometries,” Handbook of coding theory. V . S. Pless and W. C. Huffman, Eds., Amsterdam, The Netherlands: Elsevier, 1998, pp.1269-1343

    1998

  3. [3]

    On self-dual codes over some prime fields,

    K. Betsumiya, S. Georgiou, T. A. Gulliver, M. Harada, and C. Koukouvinos, “On self-dual codes over some prime fields,” Discrete Math., vol. 262, nos. 1-3, pp. 37-58, Feb. 2003

    2003

  4. [4]

    On a class of error correcting binary group codes,

    R. C. Bose and D. K. Ray-Chaudhuri, “On a class of error correcting binary group codes,”Inf. Control, vol. 3, pp. 279-290, Mar. 1960

    1960

  5. [5]

    A square root bound on the minimum weight in quasi-cyclic codes,

    A. Calderbank, “A square root bound on the minimum weight in quasi-cyclic codes,”IEEE Trans. Inf. Theory, vol. 29, no. 3, pp.332-337, May. 1983

    1983

  6. [6]

    On a class of primitive BCH-codes,

    P. Charpin, “On a class of primitive BCH-codes,”IEEE Trans. Inf. Theory, vol. 36, no. 1, pp. 222–228, Jan. 1990

    1990

  7. [7]

    Self-dual cyclic codes with square-root-like lower bounds on their minimum distances,

    H. Chen and C. Ding, “Self-dual cyclic codes with square-root-like lower bounds on their minimum distances,”IEEE Trans. Inf. Theory, vol. 71, no. 4, pp. 2389-2396, Apr. 2025

    2025

  8. [8]

    Repeated-root cyclic codes with optimal parameters or best parameters known,

    H. Chen, C. Xie and C. Ding, “Repeated-root cyclic codes with optimal parameters or best parameters known,”IEEE Trans. Inf. Theory, vol. 72, no. 3, pp. 1618-1628, March 2026

    2026

  9. [9]

    Ding, Codes from Difference Sets, World Scientific, 2015

    C. Ding, Codes from Difference Sets, World Scientific, 2015

    2015

  10. [10]

    The Bose and minimum distance of a class of BCH Codes,

    C. Ding, X. Du and Z. Zhou, “The Bose and minimum distance of a class of BCH Codes,”IEEE Trans. Inf. Theory, vol. 61, no. 5, pp. 2351–2356, May 2015

    2015

  11. [11]

    The dimension and minimum distance of two classes of primitive BCH codes,

    C. Ding, C. Fan, and Z. Zhou, “The dimension and minimum distance of two classes of primitive BCH codes,”Finite Fields Appl., vol. 45, pp. 237–263, May 2017

    2017

  12. [12]

    Ding and C

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

    2022

  13. [13]

    Extremal binary self-dual codes,

    S. T. Dougherty, T. A. Gulliver, and M. Harada, “Extremal binary self-dual codes,”IEEE Trans. Inf. Theory,vol. 43, no. 6, pp. 2036-2047, Nov. 1997. June 2, 2026 DRAFT 27

    2036

  14. [14]

    The Hermitian dual codes of several classes of BCH codes,

    M. Fan, C. Li and C. Ding, “The Hermitian dual codes of several classes of BCH codes,”IEEE Trans. Inf. Theory, vol. 69, no. 7, pp. 4484–4497, Mar. 2023

    2023

  15. [15]

    New constructions of MDS Euclidean self-dual codes from GRS codes and extended GRS codes,

    W. Fang and F.-W. Fu, “New constructions of MDS Euclidean self-dual codes from GRS codes and extended GRS codes,” IEEE Trans. Inf. Theory,vol. 65, no. 9, pp. 5574-5579, Sep. 2019

    2019

  16. [16]

    Two classes of LCD BCH codes over finite fields,

    Y . Fu, H. Liu, “Two classes of LCD BCH codes over finite fields,”Finite Fields Their Appl.vol. 99, Oct. 2024. Art. no. 102478

    2024

  17. [17]

    Experimental constructions of self-dual codes,

    P. Gaborit and A. Otmani, “Experimental constructions of self-dual codes,”Finite Fields Appl., vol. 9, no. 3, pp. 372-394, Jul. 2003

    2003

  18. [18]

    The dual codes of several classes of BCH codes,

    B Gong, C. Ding, and C. Li, “The dual codes of several classes of BCH codes,”IEEE Trans. Inf. Theory, vol. 68, no. 2, pp. 953-964, Mar. 2022

    2022

  19. [19]

    A class of error-correcting codes inp m symbols,

    D. C. Gorenstein and N. Zierler, “A class of error-correcting codes inp m symbols,”J. SIAM, vol. 9, pp. 207-214, Jun. 1961

    1961

  20. [20]

    Grassl, Bounds on the Minimum Distance of Linear Codes and Quantum Codes

    M. Grassl, Bounds on the Minimum Distance of Linear Codes and Quantum Codes. Accessed: Oct. 15, 2020. [Online]. Available: http://www.codetables.de

    2020

  21. [21]

    Codes for the quantum erasure channel

    M. Grassl, T. Beth, and T. Pellizzari, “Codes for the quantum erasure channel”,Physical Review A, vol. 56, no. 1, pp. 33-38, 1997

    1997

  22. [22]

    On self-dual MDS codes,

    M. Grass and T. A. Gulliver, “On self-dual MDS codes,” inProc. IEEE Int. Symp. Inf. Theory,Toronto, ON, Canada, pp. 1954-1957, Jul. 2008,

    1954

  23. [23]

    New nonbinary self-dual codes,

    T. A. Gulliver and M. Harada, “New nonbinary self-dual codes,”IEEE Trans. Inf. Theory,vol. 54, no. 1, pp. 415-417, Jan. 2008

    2008

  24. [24]

    Extremal ternary self-dual codes constructed from negacirculant matrices,

    M. Harada, W. Holzmann, H. Kharaghani, and M. Khorvash, “Extremal ternary self-dual codes constructed from negacirculant matrices,”Graphs Combinatorics,vol. 23, no. 4, pp. 401-417, Aug. 2007

    2007

  25. [25]

    Codes correcteurs d’erreurs,

    A. Hocquenghem, “Codes correcteurs d’erreurs,”Chiffres, vol. 2, no. 2, pp. 147-156, 1959

    1959

  26. [26]

    W. C. Huffman and V . Pless, Fundamentals of error-correcting codes. Cambridge University Press, Cambridge, U. K., 2003

    2003

  27. [27]

    New MDS self-dual codes from generalized Reed-Solomon codes,

    L. Jin and C. Xing, “New MDS self-dual codes from generalized Reed-Solomon codes,”IEEE Trans. Inf. Theory,vol. 63, no. 3, pp. 1434-1438, Mar. 2017

    2017

  28. [28]

    Dimensions of three types of BCH codes over GF(q),

    H. Liu, C. Ding and C. Li, “Dimensions of three types of BCH codes over GF(q),”Discrete Math., vol. 340, no. 8, pp. 1910–1927, Aug. 2017

    1910

  29. [29]

    F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam: North-Holland, 1986

    1986

  30. [30]

    Symmetry codes over GF (3) and new five-designs

    V . Pless, “Symmetry codes over GF (3) and new five-designs” Journal of Combinatorial Theory, vol. 12, pp.119-142, Jul. 1972

    1972

  31. [31]

    A generalization of the BCH bound for cyclic codes, including the Hartmann-Tzeng bound,

    C. Roos, “A generalization of the BCH bound for cyclic codes, including the Hartmann-Tzeng bound,” Journal of Combinatorial Theory, Series A, vol. 33, pp. 229-232, Mar. 1982

    1982

  32. [32]

    Self-dual codes and orthogonal matrices over large finite fields,

    M. Shi, L. Sok, and P. Sole, “Self-dual codes and orthogonal matrices over large finite fields,”Finite Fields Appl., vol. 54, pp. 297-314, Nov. 2018

    2018

  33. [33]

    Two classes of constacyclic codes with variable parameters[(q m −1)/r,k,d],

    Z. Sun, C. Ding, and X. Wang, “Two classes of constacyclic codes with variable parameters[(q m −1)/r,k,d],”IEEE Trans. Inf. Theory, vol. 70, no. 1, pp.93-114, Jan. 2024

    2024

  34. [34]

    An infinite family of binary cyclic codes with best parameters,

    Z. Sun, C. Li, and C. Ding, “An infinite family of binary cyclic codes with best parameters,”IEEE Trans. Inf. Theory, vol. 70, no. 4, pp. 2411–2418, Apr. 2024

    2024

  35. [35]

    Binary[n,(n+1)/2]cyclic codes with good minimum distances,

    C. Tang, C. Ding, “Binary[n,(n+1)/2]cyclic codes with good minimum distances,”IEEE Trans. Inf. Theory, vol. 68, no. 12, pp. 7842–7849, Dec. 2022. June 2, 2026 DRAFT 28

    2022

  36. [36]

    Two classes of narrow-sense BCH codes and their duals,

    X. Wang, J. Wang, C. Li, and Y . Wu, “Two classes of narrow-sense BCH codes and their duals,”IEEE Trans. Inf. Theory, vol. 70, no. 1, pp. 131-144, Jan. 2023

    2023

  37. [37]

    The duals of narrow-sense BCH codes with length qm−1 λ ,

    X. Wang, C. Xiao, and D. Zheng, “The duals of narrow-sense BCH codes with length qm−1 λ ,”IEEE Trans. Inf. Theory, vol. 70, no. 11, pp. 7777-7789, Nov. 2024

    2024

  38. [38]

    Minimum cyclotomic coset representatives and their applications to BCH codes and Goppa codes,

    D. Yue and Z. Feng, “Minimum cyclotomic coset representatives and their applications to BCH codes and Goppa codes,” IEEE Trans. Inf. Theory, vol. 46, no. 7, pp. 2625–2628, Nov. 2000

    2000

  39. [39]

    A unified approach to construct MDS self-dual codes via Reed-Solomon codes,

    A. Zhang and K. Feng, “A unified approach to construct MDS self-dual codes via Reed-Solomon codes,”IEEE Trans. Inf. Theory,vol. 66, no. 6, pp. 3650-3656, Jun. 2020. June 2, 2026 DRAFT

    2020