pith. sign in

arxiv: 1907.07111 · v1 · pith:DYCLOLG3new · submitted 2019-07-14 · 💻 cs.IT · math.IT

Construction and enumeration for self-dual cyclic codes of even length over mathbb{F}_(2^m) + umathbb{F}_(2^m)

Yuan Cao , Yonglin Cao , Hai Q. Dinh , Fang-Wei Fu , Fanghui Ma This is my paper

Pith reviewed 2026-05-24 21:37 UTC · model grok-4.3

classification 💻 cs.IT math.IT
keywords self-dual cyclic codesfinite chain ringsgenerator polynomialsenumerationGray mapquasi-cyclic codesfinite fields
0
0 comments X

The pith

Every self-dual cyclic code over the chain ring R of length 2^s n with n odd has an explicit generator polynomial representation and an exact counting formula.

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

The paper gives an explicit representation for every self-dual cyclic code over R = F_{2^m} + u F_{2^m} (u^2 = 0) when the length is 2^s times an odd integer n. It also supplies a direct method to list all distinct such codes and a closed formula for their total number. These codes can be mapped by a Gray map that preserves orthogonality and distances to produce self-dual 2-quasi-cyclic codes over the base field F_{2^m} of length 2^{s+1} n. A reader cares because the representation turns an existence question into a constructive enumeration problem inside algebraic coding theory.

Core claim

Every self-dual cyclic code over the finite chain ring R of length 2^s n with n odd admits an explicit representation by a generator polynomial that satisfies the self-duality condition, all such codes can be obtained by a calculation method that enumerates the valid polynomials, and the total number of these codes is given by a clear formula derived from that enumeration.

What carries the argument

The generator-polynomial description of cyclic codes over the chain ring R together with the algebraic condition that forces the code to equal its dual.

If this is right

  • All self-dual cyclic codes arise from choices of generator polynomials that divide x^{2^s n}-1 and satisfy the duality condition derived from the ring structure.
  • The total number of such codes equals a product, over the irreducible factors of x^n-1, of the number of admissible choices for each local component.
  • The Gray map sends each such code to a self-dual 2-quasi-cyclic code over F_{2^m} of length 2^{s+1}n while preserving the minimum distance.
  • Orthogonality with respect to the standard inner product is maintained under the map from R to F_{2^m}^2.

Where Pith is reading between the lines

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

  • The counting formula supplies a benchmark that could be checked by exhaustive search for the smallest values of s and m with n=1 or n=3.
  • The same decomposition technique might apply to other chain rings of nilpotency index 2 if the length factorization can be handled similarly.
  • The resulting 2-quasi-cyclic codes over the field could be tested for optimality against known tables of best-known codes for the same length and dimension.

Load-bearing premise

The assumption that n is odd together with u squared equals zero permits a canonical decomposition that covers every self-dual cyclic code by the stated generator-polynomial forms.

What would settle it

Existence of even one self-dual cyclic code over R of length 2^s n (n odd) whose generator polynomial set falls outside every form listed in the explicit representation.

read the original abstract

Let $\mathbb{F}_{2^m}$ be a finite field of cardinality $2^m$, $R=\mathbb{F}_{2^m}+u\mathbb{F}_{2^m}$ $(u^2=0)$ and $s,n$ be positive integers such that $n$ is odd. In this paper, we give an explicit representation for every self-dual cyclic code over the finite chain ring $R$ of length $2^sn$ and provide a calculation method to obtain all distinct codes. Moreover, we obtain a clear formula to count the number of all these self-dual cyclic codes. As an application, self-dual and $2$-quasi-cyclic codes over $\mathbb{F}_{2^m}$ of length $2^{s+1}n$ can be obtained from self-dual cyclic code over $R$ of length $2^sn$ and by a Gray map preserving orthogonality and distances from $R$ onto $\mathbb{F}_{2^m}^2$.

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

1 major / 1 minor

Summary. The paper claims to give an explicit representation for every self-dual cyclic code over the finite chain ring R = F_{2^m} + u F_{2^m} (u^2=0) of length 2^s n (n odd), a method to enumerate all such distinct codes, a closed-form counting formula, and an application constructing self-dual 2-quasi-cyclic codes over F_{2^m} of length 2^{s+1}n via an orthogonality-preserving Gray map.

Significance. If the representation is exhaustive and the counting formula correct, the work supplies a constructive and enumerative tool for self-dual codes over this chain ring, which is useful for applications in quasi-cyclic code design. The odd-n hypothesis enables the standard unique factorization of x^n-1, but the explicit form and count would be a concrete advance only if both directions of the correspondence are fully established.

major comments (1)
  1. [Main construction and generator-polynomial description (likely §§3-4)] The central claim requires proving both (i) every code generated by the proposed form is self-dual and (ii) every self-dual cyclic code arises in exactly this form. The manuscript must therefore verify exhaustiveness of the decomposition of (x^{2^s n}-1) using the factorization of x^n-1 (n odd) together with the nilpotency u^2=0; if additional minimal generators appear for s≥2 from u-multiples, the representation and counting formula are incomplete.
minor comments (1)
  1. [Abstract] The abstract states both an 'explicit representation' and a 'calculation method to obtain all distinct codes'; the main text should clarify whether the latter is merely the counting formula or an additional algorithmic procedure.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the careful reading and for highlighting the importance of establishing both directions of the claimed correspondence. We address the major comment below.

read point-by-point responses

  1. Referee: [Main construction and generator-polynomial description (likely §§3-4)] The central claim requires proving both (i) every code generated by the proposed form is self-dual and (ii) every self-dual cyclic code arises in exactly this form. The manuscript must therefore verify exhaustiveness of the decomposition of (x^{2^s n}-1) using the factorization of x^n-1 (n odd) together with the nilpotency u^2=0; if additional minimal generators appear for s≥2 from u-multiples, the representation and counting formula are incomplete.

    Authors: We agree that both (i) and (ii) are required for the central claim. Section 3 proves (i) by showing that any code generated by the stated form satisfies the self-orthogonality condition via the unique factorization of x^n−1 (n odd) over F_{2^m} and the ring structure of R, with the nilpotency u^2=0 used to control the possible products of generators. Section 4 establishes the converse (ii) by decomposing an arbitrary self-dual cyclic code as an ideal in R[x]/(x^{2^s n}−1) using the Chinese Remainder Theorem applied to the primary factors of x^n−1 lifted to powers of 2^s; the possible u-multiples are explicitly parametrized within the generator polynomials and do not produce additional minimal generators beyond the stated form, because the nilpotency index limits the annihilator ideals. Consequently the representation is exhaustive, the enumeration procedure is complete, and the counting formula follows directly from the free parameters in the canonical generators. revision: no

Circularity Check

0 steps flagged

No circularity: explicit generator form and enumeration derived from ring factorization

full rationale

The paper states it gives an explicit representation for every self-dual cyclic code of length 2^s n (n odd) over the chain ring R and a counting formula. This rests on the standard decomposition of x^{2^s n}-1 = (x^n-1)^{2^s} together with the nilpotency u^2=0 and the reciprocal/self-orthogonality conditions on the irreducible factors of x^n-1. No equations or counting arguments in the supplied text reduce a claimed prediction or uniqueness result to a fitted parameter or to a self-citation whose content is itself unverified. The central claim is a constructive classification whose completeness is asserted by direct proof of both directions (every code of the proposed form is self-dual, and every self-dual code arises in that form); this is mathematically independent of the result itself. No self-definitional, fitted-input, or ansatz-smuggling patterns appear. The derivation is therefore self-contained against external algebraic benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Only abstract available; no free parameters, axioms, or invented entities can be extracted.

pith-pipeline@v0.9.0 · 5723 in / 1083 out tokens · 21731 ms · 2026-05-24T21:37:37.995929+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

25 extracted references · 25 canonical work pages

  1. [1]

    Betsumiya, S

    K. Betsumiya, S. Ling, and F. R. Nemenzo, Type II codes over F2m + uF2m, Discrete Math. 275 (2004), no. 1-3, 43–65

    work page 2004

  2. [2]

    Bonnecaze, P

    A. Bonnecaze, P. Udaya, Cyclic codes and self-dual codes over F2 + uF2, IEEE Trans. Inform. Theory 45 (1999), 1250–1255

    work page 1999

  3. [3]

    Y. Cao, Y. Cao, H. Q. Dinh, F-W. Fu, J. Gao, S. Sriboonchitta, Co n- stacyclic codes of length nps over Fpm + uFpm, Adv. Math. Commun. 12 (2018), 231–262

    work page 2018

  4. [4]

    Cao, A class of 1-generator repeated root quasi-cyclic code s, Des

    Y. Cao, A class of 1-generator repeated root quasi-cyclic code s, Des. Codes Cryptogr. 72 (2014), 483–496

    work page 2014

  5. [5]

    Y. Cao, Y. Gao, Repeated root cyclic Fq-linear codes over Fql, Finite Fields Appl. 31 (2015), 202–227

    work page 2015

  6. [6]

    Y. Cao, Y. Cao, H. Q. Dinh, S. Jitman, An explicit representation a nd enumeration for self-dual cyclic codes over F2m + uF2m of length 2 s. Discrete Math. 342 (2019), 2077–2091

    work page 2019

  7. [7]

    Y. Cao, Y. Cao, F-W. Fu, A mass formula for self-dual cyclic code s over F2m [u] ⟨uk⟩ , submitted

    work page

  8. [8]

    B. Chen, H. Q. Dinh, H. Liu , L. Wang, Constacyclic codes of length 2ps over Fpm + uFpm, Finite Fields Appl. 37 (2016), 108–130

    work page 2016

  9. [9]

    B. Chen, S. Ling, and G. Zhang, Enumeration formulas for self-d ual cyclic codes, Finite Fields Appl. 42 (2016), 1–22

    work page 2016

  10. [10]

    H. Q. Dinh, Constacyclic codes of length 2 s over Galois extension rings of F2 + uF2, IEEE Trans. Inform. Theory 55 (2009), 1730–1740

    work page 2009

  11. [11]

    H. Q. Dinh, Constacyclic codes of length ps over Fpm + uFpm, J. Algebra, 324 (2010), 940–950

    work page 2010

  12. [12]

    H. Q. Dinh, L. Wang, S. Zhu, Negacyclic codes of length 2 ps over Fpm + uFpm, Finite Fields Appl., 31 (2015), 178-201

    work page 2015

  13. [13]

    H. Q. Dinh, S. Dhompongsa, and S. Sriboonchitta, On constacy clic codes of length 4 ps over Fpm +uFpm, Discrete Math. 340 (2017), 832–849. 32

    work page 2017

  14. [14]

    H. Q. Dinh, A. Sharma, S. Rani, and S. Sriboonchitta, Cyclic and n e- gacyclic codes of length 4 ps over Fpm + uFpm, J. Algebra Appl. Vol. 17, No. 9 (2018) 1850173 (22 pages)

    work page 2018

  15. [15]

    H. Q. Dinh, S. R. L´ opez-Permouth, Cyclic and negacyclic codes over finite chain rings, IEEE Trans. Inform. Theory 50 (2004), 1728–1744

    work page 2004

  16. [16]

    S. T. Dougherty, P. Gaborit, M. Harada, P. Sole, Type II code s over F2 + uF2, IEEE Trans. Inform. Theory 45 (1999), 32–45

    work page 1999

  17. [17]

    S. T. Dougherty, J-L. Kim, H. Kulosman, H. Liu: Self-dual code s over commutative Frobenius rings, Finite Fields Appl. 16 (2010), 14–26

    work page 2010

  18. [18]

    T. A. Gulliver, M. Harada, Construction of optimal Type IV self- dual codes over F2 + uF2, IEEE Trans. Inform. Theory 45 (1999), 2520–2521

    work page 1999

  19. [19]

    S. Han, H. Lee, and Y. Lee, Construction of self-dual codes o ver F2+uF2, Bull. Korean Math. Soc. 49 (2012), No. 1,135–143

    work page 2012

  20. [20]

    W. C. Huffman, On the decompostion of self-dual codes over F2 + uF2 with an automorphism of odd prime number, Finite Fields Appl. 13 (2007), 682–712

    work page 2007

  21. [21]

    Karadeniz, B

    S. Karadeniz, B. Yildiz, N. Aydin, Extremal binary self-dual cod es of lengths 64 and 66 from four-circulant constructions over F2 + uF2, Filo- mat, 28 (5) (2014), 937–945

    work page 2014

  22. [22]

    A. Kaya, B. Yildiz, I. Siap, New extremal binary self-dual codes from F4 + uF4-lifts of quadratic double circulant codes over F4, Finite Fields Appl. 35 (2015), 318–329

    work page 2015

  23. [23]

    A. Kaya, B. Yildiz, Various constructions for self-dual codes o ver rings and new binary self-dual codes, Discrete Math. 339 (2) (2016), 460–469

    work page 2016

  24. [24]

    S. Ling, P. Sol´ e, Type II codes over F4 + uF4, Eur. J. Comb. 22 (2001) 983–997

    work page 2001

  25. [25]

    Wan, Lectures on finite fields and Galois rings

    Z.-X. Wan, Lectures on finite fields and Galois rings. World Scientifi c Pub Co Inc. 2003. 33

    work page 2003