{"id":"db459622-f83a-441e-b072-09b69dba13ff","arxiv_id":"2506.11345","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":4.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"FDPC codes with a bidiagonal encoder and a girth-6 base graph beat 5G LDPC and polar codes at high rates using only 5 to 12 message-passing iterations.","lead":"The paper develops a new family of error-correcting codes, called FDPC codes, and shows that a practical decoder can outperform the 5G LDPC and polar codes at high rates with far fewer decoding rounds. The result matters because faster, more reliable error correction is a key ingredient for next-generation wireless and data-storage systems.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Section III's girth-6 claim is false: H_base-(5,2) in Example 2 contains a 4-cycle (columns 1,6,10,11 sum to zero), and the same cycle exists for every t≥5, so the advertised Base-II generalization is invalid as stated.","rationale":"The reader identified girth as the weak point, but located the problem in the full construction after random permutations and column deletion. My check shows the defect is more basic: the base matrix H_base-(t,2) itself does not have minimum cycle length 6. Example 2 contains an explicit 4-cycle, and the pattern persists for every t≥5. This makes the Section III generalization claim false as written. It does not, by itself, prove that the simulated FER curves are wrong, because the bidiagonal overwrite and the permuted row blocks add constraints and may eliminate this specific 4-cycle. But it removes the stated theoretical guarantee for the codes built from Base-II and leaves the performance claims without the advertised structural support. Given that a core construction in the paper is demonstrably erroneous, the current manuscript should not be accepted as is; it needs a corrected girth theorem or a full-code minimum-distance analysis and independent verification of the coding gains.","tokens_in":10134,"tokens_out":21020,"duration_ms":244815,"concrete_test":"Generate H_base-(5,2) using Algorithm 2 with t=5 (or read it from Example 2). Compute H times the vector with ones in columns 1, 6, 10, and 11 and zeros elsewhere over GF(2). The result is the all-zero vector, confirming a weight-4 base codeword and a graph 4-cycle. More generally, for any t≥5, check columns {1, 6, 2t, 2t+1} in H_base-(t,2); their syndrome is zero. If this check passes, the Section III d=6 claim is false, and the paper must be revised to state the true girth of the base matrix and to provide a verified girth/minimum-distance analysis of the final Algorithm 1 codes used in Figs. 5, 6, and 8.","verdict_should_be":"REJECT","load_bearing_attack":"Section III claims that H_base-(t,2) has minimum cycle length d=6, so that the corresponding base code has minimum distance 6. This is false already for the displayed Example 2. Numbering the rows as vertices 1,...,10, the four columns 1, 6, 10, and 11 of H_base-(5,2) have supports {1,2}, {6,7}, {1,6}, and {2,7} respectively. Their mod-2 sum is zero, so they form a weight-4 codeword in the base code and a 4-cycle (1,2,7,6,1) in the graph. For general t≥5, the same construction contains the 4-cycle (1,2,7,6,1) using columns 1, 6, 2t, and 2t+1: edges (1,2), (6,7), (1,6), (2,7). Hence the advertised girth-6 base matrix does not exist as described. This is an internal inconsistency, not merely a missing proof. The full FDPC construction overwrites some of these columns and adds permuted row blocks, so this particular 4-cycle may not survive in the final code; however it directly invalidates the stated design rationale for Base-II and the Section III generalization. Since Base-II is used for the (256,164), (1024,844), and (16384,15660) simulations, the claimed structural foundation of those results is unsupported and must be corrected or replaced with an analysis of the actual girth and minimum distance of the full parity-check matrix.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proposes constructions of Fair-Density Parity-Check (FDPC) codes, a low-complexity systematic encoder based on a bidiagonal submatrix, a generalized Base-II construction aimed at minimum cycle length 6, and numerical comparisons with 5G LDPC and polar codes. The central advertised result is that FDPC codes achieve comparable or better FER/BER with far fewer decoding iterations than the 5G benchmark codes. The paper includes concrete construction algorithms, a GitHub repository with code, and simulations for several block lengths and rates.","tokens_in":10435,"tokens_out":9084,"duration_ms":92981,"significance":"If the performance claims hold, the paper would demonstrate an attractive high-rate code family with fast message-passing convergence, a useful practical property for low-latency applications. The encoding scheme is concrete and the authors provide reproducible code, which is a strength. However, the structural foundation of the paper is not sound as written: the claimed girth-6 property of the Base-II matrices is false, and no girth or minimum-distance analysis is provided for the final parity-check matrices actually used in the simulations. The simulation-based performance claims also lack statistical detail. The contributions are potentially valuable, but the paper needs substantial revision before the claims can be accepted.","major_comments":[{"comment":"The claim that H_base-(5,2) has minimum cycle length 6 is false. In the displayed matrix, columns 1, 6, 10, and 11 have supports {1,2}, {6,7}, {1,6}, and {2,7}, respectively; their mod-2 sum is zero, so they form a weight-4 codeword in the base code and a 4-cycle in the Tanner graph. For every t≥5, the same supports appear in columns 1, 6, 2t, and 2t+1 of H_base-(t,2), so the advertised d=6 property fails for the entire family. This directly contradicts the statement that the base code has minimum distance 6 and invalidates the Section III generalization as stated.","section":"Section III, Example 2 and the definition of H_base-(t,2)"},{"comment":"The paper does not establish any cycle or minimum-distance property for the final parity-check matrix H obtained after overwriting the first m_size columns with the bidiagonal encoder form (lines 13–17), appending permuted copies of the base submatrix (lines 5–11), and deleting columns (lines 19–21). These operations can create shorter cycles than those present in the base matrix, even when the base matrix has the claimed girth. Since the base-matrix d=6 claim is already false, and since the final H is the object actually decoded in Section IV, the error-floor behavior is unsupported. An analysis of the girth and minimum distance of the final code for the simulated parameters is needed before the performance advantages can be attributed to the construction.","section":"Algorithm 1, final parity-check matrix"},{"comment":"The headline performance claims—for example, the approximately 0.5 dB gain over 5G LDPC and polar codes at FER 10^-3—rest entirely on plotted FER/BER curves. The manuscript does not report the number of simulated frames, the number of error events at each SNR, or confidence intervals. At FER 10^-3 with steep curves, a small number of observed frames can shift the apparent crossover by several tenths of a dB. Please add simulation statistics or error bars, or soften the claims to match what the plots actually support.","section":"Section IV, Figs. 3–8"}],"minor_comments":[{"comment":"The text says 'FDPC(16384,15661)', but the code dimension should be 15660 based on the stated row count of 724 and block length 16384; this appears to be a typo.","section":"Section IV-F"},{"comment":"The statement 'for a given t, blocklength N≤t^2' is written for Base-I only. For Base-II the base matrix has t(t+1)/2 columns, so the blocklength bounds and column-deletion behavior should be described separately for each base.","section":"Section II-A"},{"comment":"The variable 'gap' is used inconsistently: in lines 3–10 the gap counts zeros between the two ones, while line 22 tests 'current_gap+1' as the distance between one positions. Making the definition consistent between the prose and the pseudocode would avoid confusion.","section":"Algorithm 2"},{"comment":"The introduction says the paper will 'discuss the ECP of FDPC codes after puncturing', but the column-removal operation in Algorithm 1 is shortening (it reduces the block length and dimension together), not puncturing in the standard sense. Please clarify the terminology or add the intended puncturing analysis.","section":"Section I"},{"comment":"The caption states 'minimum cycle of length 6', which is contradicted by Example 2 as explained in Major Comment 1; the figure and text must be updated to match a corrected construction or analysis.","section":"Fig. 2b caption"}],"recommendation":"major_revision","confidential_remarks":"The girth-6 claim for Base-II is demonstrably false and is load-bearing for the generalization and for the interpretation of the Base-II simulation results. The authors need to correct or replace this construction, or provide a full analysis of the final parity-check matrices. The absence of simulation statistics is also a serious reproducibility concern for the central quantitative claims. These are fixable in principle, so I do not recommend rejection, but the revision is substantial."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"You should know before spending time on this: the central theoretical claim of Section III is false. The paper says H_base-(5,2) in Example 2 has minimum cycle length 6, but columns 1, 6, 10, and 11 of the displayed matrix have supports {1,2}, {6,7}, {1,6}, and {2,7}, which sum to zero mod 2. That is a 4-cycle (1,2,7,6,1). For general t≥5 the same pattern holds with columns 1, 6, 2t, and 2t+1. So the base-II construction does not have girth 6, and the corresponding base code has a weight-4 codeword. This is not a missing proof; it is a direct counterexample to the stated theorem.\n\nWhat the paper does well: the construction algorithms are concrete and reproducible, the encoder is a clean bidiagonal staircase (standard, but clearly explained), and the simulation code is on GitHub. The empirical comparisons against 5G LDPC and polar codes show a consistent fast-convergence advantage at short block lengths, which is genuinely worth understanding even if the theoretical rationale is broken.\n\nThe soft spots go beyond the false girth claim. The full parity-check matrix after permutation cascading and column deletion is never analyzed for girth or minimum distance, so the error floor is unknown. The polar baseline is belief propagation, which is weak for polar codes; the stronger CA-SCL comparison appears only at (1024,844), where the FDPC advantage is modest. There are no error bars or confidence intervals on the FER curves. The base-1 matrix is acknowledged to be a column rearrangement of the authors' earlier work, and the encoding idea is the 5G bidiagonal structure, so the genuinely new content is the base-2 matrix — whose advertised property fails.\n\nIn sum: the empirical results might be real, and the paper is worth a serious referee, but only after the girth claim is corrected or removed and the full-code structure is analyzed. As it stands, the paper should not be accepted without major revision. If the authors can fix Section III and provide girth/distance analysis of the final parity-check matrix, the fast-convergence evidence would be a useful data point for short-block codes.","headline":"The Section III girth-6 theorem is false — the paper's own Example 2 contains a 4-cycle — so the theoretical foundation collapses, though the simulation evidence may still be worth a corrective review.","tokens_in":11022,"tokens_out":3832,"would_cite":false,"duration_ms":40078,"reading_group":"yes","serious_thinker":"no","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["94B35","94B05"],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper claims that FDPC codes built from stacked permuted bidiagonal base matrices need only five normalized min-sum iterations to match or beat 5G LDPC and polar BP decoders running fifty iterations.","keywords":["FDPC codes","high-rate codes","LDPC codes","polar codes","message-passing decoding","normalized min-sum","systematic encoding","minimum distance"],"falsifier":"Compute the girth of the published parity-check matrices for the reported codes, or list their minimum-weight codewords. If the final (256,164) or (1024,844) matrices contain a 4-cycle for the base-2 construction, or if a weight-4 codeword exists, then the assumed minimum distance of the final code is not 6 and the high-SNR error floor would likely be higher than claimed.","tokens_in":9907,"feed_emoji":"📡","tokens_out":9335,"duration_ms":93714,"temperature":0.7,"pith_summary":"This paper proposes a way to build high-rate Fair-Density Parity-Check (FDPC) codes and a low-complexity encoder for them. The central claim is that the new codes converge much faster under message-passing decoding than the codes used in 5G: for a (256,164) code, five iterations of normalized min-sum decoding yield about a 0.5 dB coding gain over 5G LDPC and polar codes decoded with belief propagation using fifty iterations at a frame error rate of $10^{-3}$. The paper also generalizes the construction so the base parity-check graph has minimum cycle length 6 instead of 4, and reports that a (1024,844) FDPC code with twelve iterations matches a 5G polar code decoded by list decoding with list size 8 and a 5G LDPC code decoded with fifty iterations.","feed_headline":"FDPC codes beat 5G LDPC and polar codes with 5 iterations","feed_subtitle":"At (256,164), five min-sum iterations gain about 0.5 dB over fifty-iteration standard decoders at FER 10^-3.","key_machinery":"The central object is the base parity-check matrix $H_{\\mathrm{base}}$: a $2t$-row matrix whose columns each contain exactly two ones, arranged in column groups with gaps of 0, 2, 4, ... zeros between the ones. The algorithm forms a submatrix $C$ from the columns beyond position $m_{\\mathrm{size}} = 2t(\\mathrm{num\\_per}+1)$, applies independent random column permutations to $C$, and stacks each permuted copy in a new block of $2t$ rows. The first $m_{\\mathrm{size}}$ columns are then overwritten by a bidiagonal matrix $A$, which makes each parity bit the xor of a row of the remaining part with the previous parity bit, so encoding is a simple sequential pass. Finally, columns beyond $m_{\\mathrm{size}}$ are deleted to reach the target blocklength $N$. The base-2 variant changes which column groups are kept, giving a base graph with shortest cycle 6 instead of 4.","core_discovery":"The paper's discovery is that a carefully ordered base parity-check matrix, in which each column has exactly two ones spaced by gaps of 0, 2, 4, ... zeros, can be turned into a high-rate code by stacking random column permutations of its tail and deleting columns to hit a target blocklength. The resulting FDPC codes are claimed to decode to a given FER with far fewer normalized min-sum iterations than standard decoders need for 5G LDPC and polar codes. A systematic encoder works by reshaping the first $m_{\\mathrm{size}}$ columns into a bidiagonal matrix $A$, so parity bits are computed one after another with a single bit of state. The generalization to base 2 removes columns whose ones are separated by 2, 6, 10, ... zeros, leaving a base graph whose shortest cycle has length 6, which corresponds to a base code with minimum distance 6.","pith_inferences":["The paper leaves implicit that the final stacked parity-check graph may contain 4-cycles even when the base graph has shortest cycle 6, because the permutations and column deletions are not analyzed; checking the final girth is a direct test of whether the true minimum distance is actually 6.","Because the decoder's fast convergence is demonstrated mainly down to FER $10^{-3}$ for the short codes, the paper leaves open what happens at lower error rates; a small stopping set in the final graph could produce an error floor above the promised operating point.","The construction could be tested with the random permutations replaced by deterministic cyclic shifts, allowing a search over permutation choices to maximize the final graph's girth and potentially improve minimum distance while preserving the encoder.","The claimed latency advantage could be quantified more directly by measuring wall-clock time or hardware cycle count of the 5-iteration FDPC decoder against the 50-iteration LDPC and pipelined polar BP decoders, rather than by iteration count alone."],"forward_implications":["At short block lengths of 128 to 256, FDPC codes reach a given FER with 5 normalized min-sum iterations instead of 50, so decoding latency drops by roughly an order of magnitude for the same or better reliability.","At (1024,844), the 12-iteration FDPC decoder matches CA-SCL polar decoding with list size 8 and 50-iteration 5G LDPC decoding, replacing a high-latency list decoder with a low-latency message-passing decoder.","The bidiagonal parity structure gives a systematic encoder whose per-parity-bit cost is a constant number of xor operations, making high-rate FDPC codes encodable at linear complexity.","The base-2 generalization extends the family to base graphs with minimum cycle length 6, promising a minimum distance of 6 in the base code and better high-SNR behavior if the final graph preserves that property.","For very long blocklengths near 16384, the construction reports FER around $10^{-8}$ with 12 iterations, indicating that the fast-convergence benefit persists at scale."],"supporting_citations":[{"why":"Introduces the FDPC code family whose base matrix this paper rearranges and extends.","marker":"[13]"},{"why":"Describes the 5G LDPC design and the bidiagonal encoding structure reused here as the baseline and encoder model.","marker":"[14]"},{"why":"Defines polar codes, the baseline for the BP decoding comparisons at short blocklengths.","marker":"[11]"},{"why":"Provides the pipelined polar BP decoder used for the latency comparison.","marker":"[16]"},{"why":"Defines CA-SCL list decoding of polar codes, the baseline for the (1024,844) comparison.","marker":"[12]"},{"why":"Supplies the scaled min-sum decoder used for the polar code baselines.","marker":"[17]"}],"fun_headline_variants":["FDPC codes: 5 iterations outperform 5G LDPC and polar","FDPC codes beat 5G LDPC and polar in just 5 iterations","FDPC codes: fast 5-iteration decoding beats 5G LDPC and polar","New FDPC codes: construction and 5-iteration advantage over 5G LDPC"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The construction assumes that the base matrix's good shortest-cycle length survives the random column permutations and column deletions in the final stacked parity-check matrix, even though only the base matrix's cycles are analyzed.","fun_headline_variants_meta":{"raw":{"variants":["FDPC codes: 5 iterations outperform 5G LDPC and polar","FDPC codes beat 5G LDPC and polar in just 5 iterations","FDPC codes: fast 5-iteration decoding beats 5G LDPC and polar","New FDPC codes: construction and 5-iteration advantage over 5G LDPC"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001256,"raw_usage":{"total_tokens":5089,"prompt_tokens":833,"completion_tokens":4256,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":449,"completion_tokens_details":{"reasoning_tokens":4158}},"tokens_in":449,"tokens_out":4256,"duration_ms":30367,"temperature":1.0,"reasoning_tokens":4158,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-07T04:11:02.615610+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Compute the girth of the published parity-check matrices for the reported codes, or list their minimum-weight codewords. If the final (256,164) or (1024,844) matrices contain a 4-cycle for the base-2 construction, or if a weight-4 codeword exists, then the assumed minimum distance of the final code is not 6 and the high-SNR error floor would likely be higher than claimed.","supporting_citations":[{"cited_title":"High-Rate Fair-Density Parity-Check Codes","cited_arxiv_id":"2402.06814","evidence_quote":"Introduces the FDPC code family whose base matrix this paper rearranges and extends."},{"cited_title":"Design of low-density parity check codes for 5G new radio,","cited_arxiv_id":null,"evidence_quote":"Describes the 5G LDPC design and the bidiagonal encoding structure reused here as the baseline and encoder model."},{"cited_title":"Channel polarization: A method for constructing capacity- achieving codes for symmetric binary-input memoryless channels,","cited_arxiv_id":null,"evidence_quote":"Defines polar codes, the baseline for the BP decoding comparisons at short blocklengths."},{"cited_title":"Polar codes: A pipelined implementation,","cited_arxiv_id":null,"evidence_quote":"Provides the pipelined polar BP decoder used for the latency comparison."},{"cited_title":"Early stopping criteria for energy-efficient low-latency belief-propagation polar code decoders,","cited_arxiv_id":null,"evidence_quote":"Supplies the scaled min-sum decoder used for the polar code baselines."}],"review_version":1}