{"id":"c654cff1-a2ce-4e44-9973-a14179f9881a","arxiv_id":"1908.07368","paper_version":1,"verdict":"REJECT","confidence":"MODERATE","novelty_score":3.0,"correctness_risk":"high","formal_verification":"none","parameter_count":0,"one_line_summary":"The paper re-derives the known structure of simple-root constacyclic codes over finite chain rings using primitive idempotents, but its new self-duality characterization is incomplete and appears flawed.","lead":"This paper uses idempotents, which are projection-like elements, to split constacyclic error-correcting codes over finite chain rings into simpler components. It then describes dual codes and gives conditions for self-dual codes, but much of this repeats earlier work and a key theorem is not proved.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 5.1's self-duality criterion is false: for l=2 it contradicts the paper's own Example 1, because the complement idempotent θ_l pairs with the lowest exponent instead of disappearing.","rationale":"The reader's verdict of REJECT is supported, but the most load-bearing concern is not the coprime-length assumption. Section 4 explicitly states (n,p)=1 before the construction, so the restriction to simple-root constacyclic codes is an acknowledged scope limitation rather than an internal contradiction. The genuinely fatal defect is Theorem 5.1: its self-duality condition is not derived from the required matching of exponents and, for l=2, it contradicts the paper's own Example 1. The example itself is also internally inconsistent, switching between Z72 and Z49, which reinforces the impression that the self-duality computations were not checked. The earlier decomposition and dual theorems (4.1-4.3) appear structurally plausible, but the central advertised new result, the characterization of non-trivial self-dual constacyclic codes, is invalid as stated. Since this concern does not change the reader's REJECT verdict, the recommended final verdict is UNCHANGED. I partially agree with the reader: the reader's rationale also identifies Theorem 5.1, but their stated weakest assumption focuses on the (n,p)=1 caveat, which is not the primary defect.","tokens_in":13005,"tokens_out":11439,"duration_ms":105642,"concrete_test":"Recompute Example 1 over Z49 (the paper mislabels it as Z72): n = 6, t = 2, x = X + <X^6 - 1>, e2 as computed, and β = 1 + x^5 - e2 - e2^*. (1) Verify that β is an idempotent orthogonal to e2 and e2^*, so the canonical decomposition is C = e2 R[x] ⊕ 7β R[x] with l = 2, r0 = 0, r1 = 1, and θ2 = 1 - e2 - β = e2^*. (2) Apply Theorem 4.3 to obtain C^⊥ = γ^2 θ0^* R[x] ⊕ γ^1 θ1^* R[x] ⊕ γ^0 θ2^* R[x] = 7β^* R[x] ⊕ e2 R[x]. (3) Check β^* = β and use the listed relations e_i^* = c_i e_{5-i} to verify that the γ^0 component e2 R[x] indeed appears; if so C = C^⊥. (4) Evaluate Theorem 5.1 for l = 2: it would require 2r0 = t and θ0 ∼ θ0^*, but 2·0 ≠ 2 and e2 is not associated to e2^*. A true statement of the test is that the example is self-dual while the stated criterion fails, settling that Theorem 5.1 is false.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The load-bearing defect is in Theorem 5.1. For a code C = ⊕_{i=0}^{l-1} γ^{r_i} θ_i R[x] with 0 ≤ r0 < ... < r_{l-1} < t and ∑_{i=0}^l θ_i = 1, the equality C = C^⊥ is obtained by matching the exponents of C with those of C^⊥ = ⊕_{i=0}^l γ^{t-r_i} θ_i^* R[x] (Theorem 4.3). Because r_l = t, the i = l term contributes exponent 0 with idempotent θ_l^*. An exponent-0 component of C must therefore be paired with θ_l^*, not with θ_0^*. The proof of Theorem 5.1 instead asserts 'we must have θ_l = 0' and then pairs only indices 0,...,l-1 according to i+j ≡ 0 mod (l-1). This forces conditions such as r0 + r0 = t or r_{l-1} + r_{l-1} = t, contradicting the strict ordering when l > 1. Example 1 is exactly the case l = 2, t = 2, r0 = 0, r1 = 1, θ0 = e2, θ1 = β, θ2 = e2^*, with C = e2 Z49[x] ⊕ 7β Z49[x] claimed to be self-dual. The criterion of Theorem 5.1 demands 2r0 = t and θ0 ∼ θ0^*, i.e. 0 = 2 and e2 ∼ e2^*, both false. Thus the advertised characterization of non-trivial self-dual constacyclic codes is unsupported and contradicted by the paper's own example.","agreement_with_reader":"partial"},"referee_report":null,"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Colleague,\n\nThe paper gives a clean idempotent decomposition for constacyclic codes over finite chain rings under the simple-root condition (n,p)=1. The construction of primitive idempotents via Bezout/CRT in Section 3 is standard but clearly presented, and Theorems 4.1-4.3 on the structure of codes and duals are correct, with a sound size argument in Corollary 4.2. If the paper stopped there it would be a reasonable expository note, though most of that material is already in Dinh-Lopez-Permouth, Kanwar-Lopez-Permouth, and Batoul et al., which the authors cite.\n\nThe advertised new result, Theorem 5.1, does not hold. The proof says \"we must have theta_l = 0\" and then pairs indices only up to l-1. But Theorem 4.3 gives C^perp = sum_{i=0}^l gamma^{t-r_i} theta_i^* R[x] with r_l = t, so theta_l^* always appears at exponent 0. For C = C^perp, that exponent-0 component has to match an exponent-0 component of C, which means theta_0 (or some theta_i with r_i=0) must equal theta_l^* modulo units. The condition \"i+j ≡ 0 mod l-1\" ignores this term. In the l=2, t=2, r0=0, r1=1 case, Theorem 5.1 demands 2r0 = t and theta_0 ~ theta_0^*, which is false, yet the paper's own Example 1 exhibits a self-dual code of that form. So the central characterization of non-trivial self-dual codes is unsupported and contradicted by the authors' example.\n\nOther soft spots: Theorems 5.3 and 6.2 are stated without proof, just \"similar to\" earlier arguments. The example mixes Z72 and Z49 carelessly; it is evidently about Z49. The paper also admits it is standardizing known results, so the novelty is low.\n\nBottom line: the structure part is fine and might be useful to someone needing a self-contained account. The self-dual part is broken and should not be cited. I would not send this to a serious referee as is; it needs major correction or reduction to the expository sections.","headline":"The idempotent structure theorems are solid but largely known; the advertised self-dual characterization is false and contradicts the paper's own example.","tokens_in":13929,"tokens_out":5165,"would_cite":false,"duration_ms":42270,"reading_group":"no","serious_thinker":"no","would_accept_peer_review":false},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["94B15","94B05"],"pacs":[],"model":"deepseek-v4-flash","headline":"Idempotents give a complete structure theorem for constacyclic codes over finite chain rings and their duals.","keywords":["finite chain ring","constacyclic code","primitive idempotent","self-dual code","dual code","simple-root code","reciprocal polynomial","cyclic code"],"falsifier":"Take $R=\\mathbb{Z}_4$, $n=3$, $\\lambda=1$ (so the hypothesis $(n,p)=1$ holds) and enumerate every ideal of $\\mathbb{Z}_4[X]/\\langle X^3-1\\rangle$ together with its dual. The theorem predicts each ideal is a direct sum of components $\\gamma^{r_i}\\theta_iR[x]$ and each dual is the mirrored sum $\\gamma^{t-r_i}\\theta_i^*R[x]$; any ideal failing this form disproves the structure theorem.","tokens_in":12815,"feed_emoji":"🧩","tokens_out":11145,"duration_ms":102929,"temperature":0.7,"pith_summary":"The paper proves a structure theorem for simple-root constacyclic codes over finite chain rings. When the code length $n$ is coprime to the characteristic $p$ of the residue field, $X^n-\\lambda$ factors into pairwise coprime basic irreducible polynomials, and the quotient ring $R[X]/\\langle X^n-\\lambda\\rangle$ carries a unique complete set of primitive pairwise orthogonal idempotents. Every $\\lambda$-constacyclic code then decomposes uniquely as a direct sum of components $\\gamma^{r_i}\\theta_i R[x]$, with $\\gamma$ the generator of the maximal ideal and strictly increasing exponents $r_i$; the dual code is the mirror image with exponents $t-r_i$ and each idempotent replaced by its reciprocal. This yields explicit generators, sizes, and a characterization of non-trivial self-dual constacyclic codes, all reducing to cyclic and negacyclic cases because a non-trivial self-dual constacyclic code forces $\\lambda=\\pm1$.","feed_headline":"Idempotents unlock every simple-root constacyclic code","feed_subtitle":"Dual codes mirror the idempotent pieces, and self-duality reduces to cyclic and negacyclic cases.","key_machinery":"The carrying mechanism is the complete set of primitive pairwise orthogonal idempotents of the quotient ring. For $g=\\prod g_i$ with pairwise coprime primary factors, a B\\'ezout identity $u_ig_i+v_i\\hat{g}_i=1$ produces $e_i=v_i(x)\\hat{g}_i(x)$, the unique idempotent with $e_iR[x]\\cong R[X]/\\langle g_i\\rangle$, and these $e_i$ sum to $1$. The idempotents decompose the ring into local component rings, so every ideal splits componentwise. The reciprocal-polynomial map $f\\mapsto f^*$ turns ideals into ideals, and the identity $\\mathcal{C}^\\perp=A(\\mathcal{C})^*$ converts the decomposition of $\\mathcal{C}$ into the mirrored decomposition of $\\mathcal{C}^\\perp$. The entire code and duality theory is thereby reduced to bookkeeping of $\\gamma$-exponents and idempotent-reciprocal pairings.","core_discovery":"The central discovery is that, under $(n,p)=1$, the quotient ring $R[x]=R[X]/\\langle X^n-\\lambda\\rangle$ has a unique complete set $\\{e_1,\\ldots,e_r\\}$ of primitive pairwise orthogonal idempotents, one per monic basic irreducible factor $f_i$ of $X^n-\\lambda$, with $e_iR[x]\\cong R[X]/\\langle f_i\\rangle$. Every ideal of $R[x]$, i.e. every $\\lambda$-constacyclic code, is therefore a direct sum $\\mathcal{C}=\\oplus_{i=1}^{r}\\gamma^{s_i}e_iR[x]$ for unique $s_i\\in\\{0,\\ldots,t\\}$, and grouping equal exponents gives the canonical form $\\mathcal{C}=\\oplus_{i=0}^{l-1}\\gamma^{r_i}\\theta_iR[x]$ with $0\\le r_0<\\cdots<r_{l-1}<t$. The dual is then $\\mathcal{C}^\\perp=\\oplus_{i=0}^{l}\\gamma^{t-r_i}\\theta_i^*R[x]$, where $*$ is the reciprocal-polynomial map, and the annihilator of $\\mathcal{C}$ is the same sum before applying $*$. From this, $\\mathcal{C}$ is non-trivially self-dual exactly when the exponents pair as $r_i+r_j=t$ and the corresponding idempotents $\\theta_i$ and $\\theta_j^*$ are associated, under the pairing $i+j\\equiv 0\\bmod l-1$; for cyclic and negacyclic codes this becomes the concrete cyclotomic condition $q^i\\not\\equiv -1\\bmod n$ (or modulo $2n$) for all $i$.","pith_inferences":["The idempotent decomposition suggests a direct computational method: enumerate all self-dual codes by scanning subsets of cyclotomic cosets and checking reciprocal association, rather than searching the full ideal lattice.","The reciprocal pairing on idempotents may reflect a duality on the poset of components; analyzing this duality could yield a partial structure theory for repeated-root lengths, even though the present theorem stops at simple roots.","Because self-duality forces $\\lambda=\\pm1$, the classification of all self-dual constacyclic codes over finite chain rings is no larger than the cyclic and negacyclic families, up to the ring isomorphisms that identify $1+\\gamma R$ and $-1+\\gamma R$ perturbations with those two families.","The same B\\'ezout-idempotent construction could extend to finite local rings that are not chain rings whenever each component ring has a known ideal lattice, replacing the single $\\gamma$-chain with whatever primary ideals occur."],"forward_implications":["Every simple-root $\\lambda$-constacyclic code has a canonical single generator $w=\\sum_{i=0}^{l-1}\\gamma^{r_i}\\theta_i$, so membership and size $|\\mathcal{C}|=|F_q|^{\\sum(t-r_i)\\deg g_i}$ can be read directly from the decomposition.","The dual of any such code is obtained by the mirror recipe, so finding dual codes no longer requires solving linear equations over the ring.","A non-trivial self-dual constacyclic code can exist only for $\\lambda=1$ or $\\lambda=-1$, so the full constacyclic self-dual classification reduces to the cyclic and negacyclic classifications.","For cyclic codes of even nilpotency index, non-trivial self-dual codes exist exactly when some primitive idempotent is not associated to its reciprocal, equivalently when $q^i\\not\\equiv -1\\bmod n$ for all $i$; the analogous negacyclic condition is modulo $2n$.","The results unify and extend earlier structure theorems for cyclic and negacyclic codes over $\\mathbb{Z}_{p^m}$ and finite chain rings to all constacyclic codes in the simple-root case."],"supporting_citations":[{"why":"Supplies the factorization of regular polynomials into regular primary pairwise-coprime factors, and the criterion that coprimality over $R[X]$ is equivalent to coprimality over the residue field, underpinning the idempotent construction.","marker":"[12]"},{"why":"Characterizes finite chain rings, proves each quotient by a basic irreducible polynomial is again a chain ring, and gives the factorization of $X^n-\\lambda$ under $(n,p)=1$ used throughout Section 4.","marker":"[4]"},{"why":"Provides the structure of cyclic codes over $\\mathbb{Z}_{p^m}$ and the idempotent-lifting perspective that the paper standardizes to arbitrary finite chain rings.","marker":"[9]"},{"why":"Supplies the identity $\\mathcal{C}^\\perp=A(\\mathcal{C})^*$ and the fact that over a finite field only cyclic and negacyclic codes are self-orthogonal, both used in the dual and self-duality proofs.","marker":"[8]"},{"why":"Gives the size identity $|\\mathcal{C}||\\mathcal{C}^\\perp|=|R|^n$, used to prove that the dual decomposition has the correct cardinality.","marker":"[13]"},{"why":"Establishes the earlier self-dual cyclic code characterization that Theorem 5.4 and Corollary 5.2 generalize or recover.","marker":"[2]"},{"why":"Provides the negacyclic self-dual code results and the factorization of $X^n+1$ used in Section 6.","marker":"[7]"},{"why":"Gives the ring isomorphisms that reduce general constacyclic self-dual codes to cyclic and negacyclic ones when $\\lambda\\in 1+\\gamma R$ or $\\beta\\in -1+\\gamma R$.","marker":"[1]"},{"why":"Proves uniqueness of a complete set of primitive pairwise orthogonal idempotents, on which the canonical decomposition rests.","marker":"[10]"}],"fun_headline_variants":["Idempotents reveal constacyclic code structure over chain rings","Pairwise orthogonal idempotents decompose constacyclic codes","Complete idempotent set gives dual codes and self-duality","Exponent pairing characterizes self-dual constacyclic codes","Idempotent pieces yield all constacyclic codes and duals"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is that the code length $n$ is coprime to the characteristic of the residue field, making $X^n-\\lambda$ factor without repeated factors; without that assumption the primitive-idempotent decomposition is not guaranteed to hold.","fun_headline_variants_meta":{"raw":{"variants":["Idempotents reveal constacyclic code structure over chain rings","Pairwise orthogonal idempotents decompose constacyclic codes","Complete idempotent set gives dual codes and self-duality","Exponent pairing characterizes self-dual constacyclic codes","Idempotent pieces yield all constacyclic codes and duals"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000938,"raw_usage":{"total_tokens":4044,"prompt_tokens":1010,"completion_tokens":3034,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":626,"completion_tokens_details":{"reasoning_tokens":2945}},"tokens_in":626,"tokens_out":3034,"duration_ms":19652,"temperature":1.0,"reasoning_tokens":2945,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T12:56:27.100359+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Take $R=\\mathbb{Z}_4$, $n=3$, $\\lambda=1$ (so the hypothesis $(n,p)=1$ holds) and enumerate every ideal of $\\mathbb{Z}_4[X]/\\langle X^3-1\\rangle$ together with its dual. The theorem predicts each ideal is a direct sum of components $\\gamma^{r_i}\\theta_iR[x]$ and each dual is the mirrored sum $\\gamma^{t-r_i}\\theta_i^*R[x]$; any ideal failing this form disproves the structure theorem.","supporting_citations":[{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the factorization of regular polynomials into regular primary pairwise-coprime factors, and the criterion that coprimality over $R[X]$ is equivalent to coprimality over the residue field, underpinning the idempotent construction."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Characterizes finite chain rings, proves each quotient by a basic irreducible polynomial is again a chain ring, and gives the factorization of $X^n-\\lambda$ under $(n,p)=1$ used throughout Section 4."},{"cited_title":"Kanwar, S","cited_arxiv_id":null,"evidence_quote":"Provides the structure of cyclic codes over $\\mathbb{Z}_{p^m}$ and the idempotent-lifting perspective that the paper standardizes to arbitrary finite chain rings."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the identity $\\mathcal{C}^\\perp=A(\\mathcal{C})^*$ and the fact that over a finite field only cyclic and negacyclic codes are self-orthogonal, both used in the dual and self-duality proofs."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Gives the size identity $|\\mathcal{C}||\\mathcal{C}^\\perp|=|R|^n$, used to prove that the dual decomposition has the correct cardinality."},{"cited_title":"Batoul, K","cited_arxiv_id":null,"evidence_quote":"Establishes the earlier self-dual cyclic code characterization that Theorem 5.4 and Corollary 5.2 generalize or recover."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides the negacyclic self-dual code results and the factorization of $X^n+1$ used in Section 6."},{"cited_title":"Batoul, K","cited_arxiv_id":null,"evidence_quote":"Gives the ring isomorphisms that reduce general constacyclic self-dual codes to cyclic and negacyclic ones when $\\lambda\\in 1+\\gamma R$ or $\\beta\\in -1+\\gamma R$."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Proves uniqueness of a complete set of primitive pairwise orthogonal idempotents, on which the canonical decomposition rests."}],"review_version":1}