Pith. sign in

REVIEW 2 minor 26 references

An Explication of Optimal Equidistant Codes

T0 review · 0 major / 2 minor · reviewed 2026-06-30 · grok-4.3

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

Pith's one-line read Characterizations of optimal equidistant binary codes have overlooked one subcase when n ≡ 2 mod 4.

desk verdict This is a careful expository review that notes one overlooked subcase and some 1973 work but adds no new theorems or derivations. read the letter →

arxiv 2606.29022 v1 pith:UPQOT46J submitted 2026-06-27 math.CO

Douglas R. Stinson This is my paper
classification math.CO
keywords equidistantcodesbinarysymmetricBIBDoptimalcodecharacterizationsconstantweight
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 expository paper examines the long-standing problem of characterizing binary codes of length n that achieve both the largest possible minimum distance and the maximum number of codewords. It collects and unifies results from multiple authors showing that such optimal equidistant codes correspond to symmetric balanced incomplete block designs with specific parameters. The review notes that an early 1973 paper by Marrero and Butson on the topic went unnoticed in subsequent literature. It further points out that existing lists of these codes and designs are incomplete for the congruence class n ≡ 2 mod 4.

What carries the argument

Symmetric balanced incomplete block designs with parameters tied to code length n and distance d, which supply the combinatorial objects whose incidence matrices yield the equidistant codes.

What would settle it

Explicit construction or non-existence proof of an equidistant binary code achieving the claimed maximum size for a concrete n ≡ 2 mod 4 that falls outside all previously listed BIBD parameter sets would decide whether the missed subcase is real.

Watch

Extended reading notes

Core claim

The paper establishes that the known characterizations of equidistant binary codes of length n with maximum distance and maximum size, which rest on correspondences with symmetric BIBDs, are missing one of the admissible subcases precisely when n ≡ 2 mod 4. It also records that the 1973 work of Marrero and Butson already contained relevant results that later authors did not cite.

Load-bearing premise

Characterizations of these optimal equidistant codes involve symmetric BIBDs with certain parameters, as studied by several authors over the years.

Editorial extensions

If this is right

  • The maximum number of codewords in an optimal equidistant binary code of length n is determined by the parameters of the corresponding symmetric BIBD.
  • For n ≡ 2 mod 4 an additional family of symmetric BIBDs (or codes) must be considered that was omitted from earlier enumerations.
  • Any complete classification of such codes must incorporate the 1973 Marrero-Butson results alongside later contributions.
  • The distance and size bounds derived from the BIBD parameters remain valid across all congruence classes of n.

Reading between the lines

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

  • The missed subcase may correspond to known but unlinked designs or to new parameter sets that admit explicit constructions.
  • Future exhaustive searches for small n ≡ 2 mod 4 could reveal whether the additional case yields codes that improve upon or match existing tables.
  • The oversight suggests that a systematic cross-check between coding-theory and design-theory databases would prevent similar gaps in related problems.
Share X Bluesky LinkedIn Reddit HN

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

0 major / 2 minor

Summary. The manuscript is an expository review of characterizations of optimal equidistant binary codes of length n (maximum distance and maximum number of codewords). It unifies prior results that connect these codes to symmetric BIBDs with standard parameters, supplies a historical note on the overlooked Marrero-Butson (1973) work, and asserts that published characterizations have missed one subcase when n ≡ 2 mod 4.

Significance. If the historical correction and the identification of the missed subcase are accurate, the paper provides a useful archival reference that prevents repetition of prior oversights in combinatorial coding theory. The unified presentation of BIBD-based characterizations is a modest but positive contribution for researchers consulting the literature; the work contains no new theorems, derivations, or code constructions.

minor comments (2)
  1. The abstract states that one subcase for n ≡ 2 mod 4 has been missed but does not name the subcase or the specific prior works that omitted it; adding a one-sentence clarification would make the central historical claim immediately verifiable without requiring the reader to consult the full BIBD literature.
  2. A compact table listing the parameter regimes (n mod 4) together with the corresponding symmetric BIBD parameters and the associated code parameters would strengthen the claimed unified presentation.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their careful reading and positive recommendation to accept the manuscript. The report accurately captures the paper's expository nature, its unification of prior results on equidistant binary codes via symmetric BIBDs, the historical note on Marrero-Butson (1973), and the identification of a missed subcase for n ≡ 2 mod 4.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity; purely expository literature review

full rationale

The paper is explicitly expository: it unifies existing characterizations of optimal equidistant binary codes (via symmetric BIBDs) and supplies historical notes plus one overlooked subcase for n ≡ 2 mod 4. No new theorems, no derivations, no parameter fitting, no predictions, and no load-bearing self-citations or ansatzes. The argument rests only on accurate citation of prior established BIBD results. No derivation chain exists to inspect for circularity.

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

The paper introduces no new free parameters, axioms, or invented entities; it reviews existing links between equidistant codes and symmetric BIBDs.

how reviews work

0 comments
Cite this review

Pith. "Pith review of An Explication of Optimal Equidistant Codes." pith.science (2026). https://pith.science/paper/UPQOT46J

@misc{pith2026260629022,
  author       = {Pith},
  title        = {Pith review of: An Explication of Optimal Equidistant Codes},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/UPQOT46J}},
  note         = {Machine review of arXiv:2606.29022}
}
abstract

We discuss the problem of characterizing equidistant binary codes of a given length $n$ having largest possible distance and the maximum number of codewords. Such characterizations have been studied by several authors over the years and they involve symmetric BIBDs with certain parameters. In this primarily expository paper, we investigate the history of this problem and give a unified presentation of the main results. Perhaps surprisingly, researchers on this problem were unaware of early relevant work by Marrero and Butson from 1973. Also, it turns out that published results on characterizations of equidistant binary codes have missed one of the possible subcases when $n \equiv 2 \bmod 4$.

Figures

Figures reproduced from arXiv: 2606.29022 by the authors.

Figure 1
Figure 1. Optimal Equidistant Binary Codes Step 2 in [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

26 extracted references · 26 canonical work pages

  1. [1]

    Fifteenth International Workshop in Algebraic and Com- binatorial Coding Theory

    L.A. Bassalygo and V.A. Zinoviev. On resolvable and near-resolvable BIB designs and q-ary equidistant codes. In “Fifteenth International Workshop in Algebraic and Com- binatorial Coding Theory”, 2016, pp. 41–46

    work page 2016

  2. [2]

    Bogdanova, V.A

    G.T. Bogdanova, V.A. Zinoviev and T.J. Todorov. On the construction ofq-ary equidis- tant codes.Problems of Information Transmission43(2007), 280–302

    work page 2007

  3. [3]

    Bogdanova and T

    G. Bogdanova and T. Todorov. Enumeration of optimal equidistant codes.Mathematics, MDPI10(2022). 1–8

    work page 2022

  4. [4]

    C.M. Cordes. A new type of combinatorial design.Journal of Combinatorial Theory A 25(1978), 251–257

    work page 1978

  5. [5]

    Delsarte

    P. Delsarte. Four fundamental parameters of a code and their combinatorial significance. Information and Control23(1973), 407–438

    work page 1973

  6. [6]

    M. Deza. Une propriete extremale des plans projectifs finis dans une classe de codes equidistants.Discrete Math.6(1973), 343–352

    work page 1973

  7. [7]

    F.-W. Fu, T. Kløve, Y. Luo and V.K. Wei. On equidistant constant weight codes. Discrete Appl. Math.128(2003), 157-164. 9

    work page 2003

  8. [8]

    J.I. Hall. Bounds for equidistant codes and partial projective planes.Discrete Math.17 (1977), 85–94

    work page 1977

Show all 26 references
  1. [9]

    Heged¨ us

    G. Heged¨ us. A new upper bound for codes with a single hamming distance.Australasian Journal of Combinatorics94(2026), 300–304

    2026

  2. [10]

    S. Hu, H. Huang and W.-H. Yu. Hegedus’ conjecture and tighter upper bounds for equidistant codes in hamming spaces. ArXiv preprint 2504.07036, April 9, 2025

    2025

  3. [11]

    Ionin and M.S

    Y.J. Ionin and M.S. Shrikhande. Equidistant families of sets.Linear Algebra and its Applications226–228(1995), 223–235

    1995

  4. [12]

    Kominers

    S.D. Kominers. An eigenvalue proof of Hegedus’s bound for codes with a single ham- ming distance. ArXiv preprint 2606.24624, June 23, 2026

    2026 arXiv

  5. [13]

    O. Marrero. A survey of pseudo (v, k, λ)-designs.Aequationes Mathematicae16(1977), 195–220

    1977

  6. [14]

    Marrero and A.T

    O. Marrero and A.T. Butson. Modular Hadamard matrices and related designs.Journal of Combinatorial Theory A15(1973), 257–269

    1973

  7. [15]

    McCarthy and S.A

    D. McCarthy and S.A. Vanstone. On the structure of regular pairwise balanced designs. Discrete Mathematics25(1979) 237–244

    1979

  8. [16]

    Mullin, B.K

    R.C. Mullin, B.K. Roy and P.J. Schellenberg. Isomorphic subgraphs having minimal intersections.Journal of the Austral. Math. Soc.35(1983), 287–306

    1983

  9. [17]

    H.J. Ryser. A note on a combinatorial problem.Proc. Amer. Math. Soc.1(1950), 422–424

    1950

  10. [18]

    Ryser.Combinatorial Mathematics

    H.J. Ryser.Combinatorial Mathematics. Mathematical Association of America, 1963

    1963

  11. [19]

    M. Plotkin. Binary codes wth specified minimum distance.IRE Transactions on In- formation Theory,6(1960), 445–450

    1960

  12. [20]

    Semakov and V.A

    N.V. Semakov and V.A. Zinoviev. Equidistantq-ary codes with maximum distance and resolvable balanced incomplete block designs.Problems of Information Transmission4 (1968), 3–10

    1968

  13. [21]

    Sinha, Z

    K. Sinha, Z. Wang and D. Wu. Good equidistant codes constructed from certain com- binatorial designs.Discrete Mathematics308(2008) 4205–4211

    2008

  14. [22]

    Stanton and R.C

    R.G. Stanton and R.C. Mullin. Inductive methods for balanced incomplete block de- signs.Annals of Mathematical Statistics,37(1966), 1348–1354

    1966

  15. [23]

    Stinson and G.H.J

    D.R. Stinson and G.H.J. van Rees. The equivalence of certain equidistant binary codes and symmetric BIBDs.Combinatorica4(1984), 357–362

    1984

  16. [24]

    van Lint

    J.H. van Lint. A theorem on equidistant codes.Discrete Math.6(1973), 353–358

    1973

  17. [25]

    van Lint

    J.H. van Lint. On equidistant binary codes of lengthn= 4k+ 1 with distanced= 2k. Combinatorica4(1984), 321–323

    1984

  18. [26]

    Proceedings of the Fifth Southeastern Con- ference on Combinatorics, Graph Theory and Computing

    S.A. Vanstone. A bound forv 0(r, λ). In “Proceedings of the Fifth Southeastern Con- ference on Combinatorics, Graph Theory and Computing” (1974), 661–673. 10

    1974

Pith tools

Reviewed June 30, 2026 · model on record in the stance chip above.