{"id":"f7a88f20-014f-46a2-b114-7472e3a63317","arxiv_id":"2607.05816","paper_version":2,"verdict":"ACCEPT","confidence":"MODERATE","novelty_score":5.0,"correctness_risk":"low","formal_verification":"none","parameter_count":1,"one_line_summary":"Forney concatenation with BCH outer codes converts bit-error probability o(1/log log n) into vanishing block-error probability at capacity-achieving rates on BMS channels.","lead":"This paper proves that a code with only a small per-bit error rate can be wrapped, via Forney concatenation, into a code whose whole block is reliable. The required bit-error decay is only o(1/log log n), far weaker than the o(1/n) needed by a direct union bound.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"No significant objection identified: Theorem 1 and Corollary 1 are internally sound; the only gap is the uninstantiated inner-code hypothesis, which is a stated sufficient condition rather than a flaw.","rationale":"The reader's weakest assumption named the same existence/decay gap, so I partially agree. However, I do not treat it as load-bearing: Theorem 1 is a conditional theorem and is proven correctly; the gap affects only the transition from a sufficient condition to an unconditional capacity-achieving construction, and known code families make the hypothesis plausible/satisfied. Therefore the reader's ACCEPT verdict stands. I verified the key step: for fixed transmitted matrix, row-decoder errors across rows are independent due to memorylessness; per-column error counts are stochastically dominated by Bin(n2,ε); Chernoff gives exponent n2D(δ||ε); union bound over n1 columns gives (4); condition (3) makes it vanish; rate product converges. BCH proof: with s~α/ε and t~2εn2, BCH redundancy s t/n~2α→0, and n2D~ε exp(Θ(α/ε))=ω(log n1) under (7). No internal inconsistency.","tokens_in":7055,"tokens_out":32258,"duration_ms":350803,"concrete_test":"Verify that a known inner family—e.g., Arikan polar codes under SC decoding or Reeves–Pfister RM codes—has a uniform bit-error upper bound ϵ=o(1/log log n) at every rate R<C(W); if so, Corollary 1 is instantiated and the caveat dissolves.","verdict_should_be":"UNCHANGED","load_bearing_attack":"I read the proof of Theorem 1 as a standard Chernoff+union bound. Independence of residual errors within a column follows from the product channel law and the row-wise action of D1; the stochastic domination by Bin(n2,ε) is valid; the rate product is correct. Corollary 1's BCH parameter choices satisfy (3), and the algebra in the D(δ||ε) estimate checks. The advertised capacity-achievement is conditional: it requires, for each R<C, an inner code-decoder sequence with rate →R and uniform bit-error probability ε=o(1/loglog n1) (or, more generally, an outer code satisfying (3)). The paper neither constructs nor cites such a family against (6); known polar/RM bit-error bounds almost certainly supply it, so this is a missing instantiation, not an internal inconsistency. No load-bearing mathematical error found.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies Forney's concatenation as a method to convert bit-level reliability into block-level reliability. Theorem 1 proves that if the outer code corrects a fraction δℓ > εℓ of residual errors and n2,ℓ D(δℓ ∥ εℓ)/log n1,ℓ → ∞, then the concatenated code has block-error probability at most n1,ℓ exp{−n2,ℓ D(δℓ ∥ εℓ)} and rate tending to the inner rate. Corollary 1 specializes the outer code to primitive narrow-sense BCH codes and shows that a sufficient condition is εℓ log log n1,ℓ → 0. The paper then concludes that any inner family with vanishing bit-error probability satisfying this condition yields a capacity-achieving concatenated family.","tokens_in":7229,"tokens_out":20772,"duration_ms":204741,"significance":"The result is a clean and useful reduction. The proof of Theorem 1 is a standard Chernoff-plus-union-bound argument and is correct. The BCH specialization provides explicit outer codes with rate tending to one and corrects a fraction 2εℓ of errors, and the resulting large-deviation algebra, with the correction noted below, supports the claimed condition. The result is substantially weaker than the direct union-bound requirement n1 εℓ → 0. The main caveat is that the capacity-achieving conclusion is conditional on the existence of inner code–decoder sequences with the stated bit-error decay; the paper neither constructs nor cites such a family. This is a missing instantiation rather than an internal inconsistency, but it should be made explicit.","major_comments":[],"minor_comments":[{"comment":"The displayed identity D(δℓ∥εℓ) = δℓ log(δℓ/εℓ) + o(δℓ) is not correct. From δℓ = 2εℓ + o(εℓ), the second term of the relative entropy is (1−δℓ) log((1−δℓ)/(1−εℓ)) = −εℓ + o(εℓ), not o(δℓ). The correct expansion is D(δℓ∥εℓ) = (2 ln 2 − 1)εℓ + o(εℓ). The conclusion D(δℓ∥εℓ) = Θ(εℓ) remains valid, but the displayed equation should be corrected.","section":"IV, proof of Corollary 1"},{"comment":"The claim that “a family with vanishing bit-error probability for rates below capacity can be converted into a capacity-achieving concatenated-code family” is unqualified. Theorem 1 requires the large-deviation condition (3), and Corollary 1 additionally requires (6). The abstract should either state these conditions explicitly or the paper should cite a known inner family (e.g., polar or Reed–Muller codes) that satisfies them. Without this, the capacity-achieving statement is only a conditional reduction.","section":"Abstract and Section I"},{"comment":"Typo: “Choose an integers ℓ” should read “Choose an integer sℓ.”","section":"IV, proof of Corollary 1"},{"comment":"The step bounding Pr{Ei,j = 1} ≤ εℓ and concluding stochastic domination by Bin(n2,ℓ, εℓ) is standard but uses a coupling that is not spelled out. A one-sentence justification would improve readability.","section":"III, proof of Theorem 1"}],"recommendation":"minor_revision","confidential_remarks":"The mathematical core is sound; Theorem 1 and Corollary 1 are correct up to the small algebraic slip in the relative-entropy expansion, which does not affect the Θ(εℓ) estimate. The main point requiring attention is the gap between the conditional theorems and the unqualified capacity-achievement claim in the abstract and introduction. I would be happy to see the paper published after that qualification and the proof correction."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Bin Zhang's note gives a clean sufficient condition under which Forney concatenation converts bit-level reliability of an inner code into block-level reliability of the concatenated code on any BMS channel. The main theorem is a standard Chernoff-plus-union-bound argument, but the statement is useful and, as far as I can tell, not in the literature. The BCH specialization is also correct: if the inner bit-error probability epsilon_n = o(1/log log n), then rate-one BCH outer codes with correction radius slightly above epsilon_n do the job. The algebra checks, including the choice of alpha and the rate loss calculation.\n\nWhat I like: the proof is honest and self-contained. The independence of residual errors across rows follows straight from memorylessness, and the stochastic domination by Bin(n2, epsilon) is valid. The paper does not pretend to construct the inner code; it gives a reduction. That is a real contribution, though a modest one.\n\nThe soft spots are the things you'd expect. First, the abstract says any family with vanishing bit-error probability below capacity can be converted. That is technically true only if one also allows an arbitrary outer code sequence chosen to satisfy (3). The paper itself only proves the BCH outer code works when epsilon log log n -> 0. For a slowly decaying epsilon, the general theorem would require an existence argument (e.g., GV-type codes) that is not stated. That is a presentation gap, not an error. Second, the paper never supplies an actual inner family with the required decay. Known polar or RM bit-error bounds almost certainly satisfy it, but the paper should have said so. As written, the headline 'capacity achievement' is conditional on an unstated instantiation. Third, the BCH proof uses Theta(...) a bit loosely at the large-deviation step; the conclusion is right, but a referee may want the constants spelled out.\n\nWho is this for? People working on capacity proofs via concatenation or on bit-to-block conversions. It is a modular tool, not a breakthrough. It deserves a proper referee: it is short, correct, and gives a genuine reduction that others may use. I would send it to review. It may need minor revisions: fix the abstract's overclaim, cite an inner family with the required decay, and tighten the Theta(...) step.","headline":"A clean and correct reduction: Forney concatenation upgrades bit-level to block-level reliability under a large-deviation condition, with BCH outer codes requiring epsilon=o(1/log log n); the main caveat is that the paper leaves the inner-code hypothesis uninstantiated.","tokens_in":7743,"tokens_out":9674,"would_cite":false,"duration_ms":95537,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"Forney's concatenation can turn bit-level reliability into block-level reliability on any binary memoryless symmetric channel, without sacrificing rate.","keywords":["capacity-achieving codes","binary memoryless symmetric channels","concatenated codes","bit-error probability","block-error probability","Forney concatenation","BCH codes","large deviations"],"falsifier":"Find a BMS channel W and an inner code–decoder sequence with rate approaching some R<C(W) and bit-error probability εℓ = o(1/log log n1,ℓ) for which the two-stage concatenation with the BCH outer code of Corollary 1 has block-error probability bounded away from zero. One direct experimental route: simulate the two-stage decoder for finite n and verify the bound n1 exp(−n2 D(δ‖ε)) — if block-error exceeds it substantially and consistently, the union bound or independence step is wrong.","tokens_in":6898,"feed_emoji":"🔗","tokens_out":8437,"duration_ms":84240,"temperature":0.7,"pith_summary":"This paper proves that, on any binary memoryless symmetric channel, a code whose per-bit error probability is small can be upgraded—by Forney's concatenation with a high-rate outer code—into a code whose whole-block error probability is small, without changing the rate. The proof identifies a precise sufficient condition: the outer code must correct a fraction δ of errors larger than the inner bit-error fraction ε, and the outer block length n2 must make n2 D(δ‖ε) (a binomial large-deviation exponent) grow faster than log n1, the union-bound cost of the number of columns. When the outer code is a binary BCH code, this condition is met whenever the inner bit-error probability is o(1/log log n1), which is dramatically slower than the o(1/n1) required by a direct union bound. The upshot: any inner family with bit-error decay o(1/log log n1) at rates below capacity is automatically converted into a capacity-achieving concatenated family. The existence of such an inner family is assumed, not constructed.","feed_headline":"Slow bit-error decay still yields capacity-achieving codes","feed_subtitle":"Concatenation with BCH outer codes upgrades weak per-bit guarantees to vanishing block errors at full rate.","key_machinery":"Forney's concatenation Con(C2,C1): codewords are n2×n1 binary matrices whose rows lie in inner code C1 and columns in outer code C2. The two-stage decoder first decodes each row with D1 (bit level), leaving per-column independent residual errors, then decodes each column with D2 (block level). The core identity is the Chernoff bound: a column survivor count Sj ∼ Bin(n2,εℓ) exceeds the correction radius tℓ with probability ≤ exp(−n2 D(δℓ‖εℓ)). The outer BCH code is the algebraic engine: primitive narrow-sense BCH codes of length 2^s−1 have designed distance 2t+1, redundancy ≤ s t, and a bounded-distance decoder; choosing s so that t ≈ 2ε n2 yields rate 1−o(1) and δ = 2ε+o(ε).","core_discovery":"The paper's central claim is Theorem 1: fix a BMS channel W and rate R < C(W). Let (C1,ℓ,D1,ℓ) be inner codes/decoders of length n1,ℓ, rate R, uniform bit-error probability εℓ = Pbit(C1,ℓ,D1,ℓ;W). Let (C2,ℓ,D2,ℓ) be outer codes/decoders of length n2,ℓ, rate tending to 1, whose decoder corrects every error pattern of weight at most tℓ = δℓ n2,ℓ. If εℓ < δℓ and n2,ℓ D(δℓ‖εℓ)/log n1,ℓ → ∞, then the concatenated code Con(C2,ℓ,C1,ℓ) decoded by row-then-column has rate tending to R and block-error probability at most n1,ℓ exp(−n2,ℓ D(δℓ‖εℓ)) → 0. Corollary 1 specializes the outer code to primitive narrow-sense BCH codes, which have rate at least 1 − st/n2 and correct t errors; the proof shows that","pith_inferences":["The result is essentially a reduction: the whole status of “capacity-achieving concatenated codes” is pinned on the existence of inner codes with bit-error decay o(1/log log n). Establishing or refuting that decay for any known capacity-approaching family would settle whether the route is real.","For channels or families where bit-error decay is slower, one could test whether the BCH condition is genuinely necessary or an artifact of the proof; a threshold lower than o(1/log log n) would require a different outer code, perhaps with δ decaying slower than ε.","The clean row-independence after row decoding relies on the memoryless channel and per-row decoders; extending the argument to channels with memory or to iterative/turbo row decoders would require a new independence argument, not covered here.","A numerical check: on a binary symmetric channel, concatenate a short inner code with a known BCH code, compare measured block-error to n1 exp(−n2 D(δ‖ε)); matching would support the exponent, while a mismatch would expose overlooked dependencies."],"forward_implications":["For any inner family with vanishing bit-error probability that satisfies condition (3), the concatenation has the same asymptotic rate and vanishing block-error probability on the same BMS channel.","For inner bit-error probability o(1/log log n), primitive narrow-sense BCH outer codes make the conversion explicit and keep the outer rate 1−o(1).","The required bit-error decay is much weaker than the union-bound threshold o(1/n), so the construction extends the class of decoders that can be promoted to block reliability.","The concatenated block-error probability obeys the quantitative bound n1 exp{−n2 D(δ‖ε)}, giving a finite-length design rule for choosing n2 relative to n1 and ε.","If such inner families exist for every rate below capacity, the concatenation construction achieves Shannon capacity on any BMS channel."],"fun_headline_variants":["Concatenation lifts bit-error decay to block-error capacity","Weak bit guarantees become block reliability at capacity","From bit flips to block reliability: capacity via concatenation","Capacity-achieving codes from weak bit-error guarantees"],"cache_read_input_tokens":2304,"weakest_assumption_plain":"The paper's capacity-achieving conclusion depends on the existence, for each rate below capacity, of an inner code–decoder sequence with rate approaching the target and bit-error probability o(1/log log n); the paper proves the conversion but never constructs or supplies a family with that decay.","fun_headline_variants_meta":{"raw":{"variants":["Concatenation lifts bit-error decay to block-error capacity","Weak bit guarantees become block reliability at capacity","From bit flips to block reliability: capacity via concatenation","Capacity-achieving codes from weak bit-error guarantees"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000856,"raw_usage":{"total_tokens":3568,"prompt_tokens":774,"completion_tokens":2794,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":518,"completion_tokens_details":{"reasoning_tokens":2730}},"tokens_in":518,"tokens_out":2794,"duration_ms":20649,"temperature":1.0,"reasoning_tokens":2730,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-02T08:23:16.105406+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Find a BMS channel W and an inner code–decoder sequence with rate approaching some R<C(W) and bit-error probability εℓ = o(1/log log n1,ℓ) for which the two-stage concatenation with the BCH outer code of Corollary 1 has block-error probability bounded away from zero. One direct experimental route: simulate the two-stage decoder for finite n and verify the bound n1 exp(−n2 D(δ‖ε)) — if block-error exceeds it substantially and consistently, the union bound or independence step is wrong.","supporting_citations":[],"review_version":2}