pith. sign in

arxiv: 1906.09792 · v1 · pith:H4BTS4CRnew · submitted 2019-06-24 · 💻 cs.IT · eess.SP· math.IT

A novel soft-aided bit-marking decoder for product codes

Gabriele Liga , Alireza Sheikh , Alex Alvarado This is my paper

Pith reviewed 2026-05-25 17:25 UTC · model grok-4.3

classification 💻 cs.IT eess.SPmath.IT
keywords product codessoft-aided decodingbit markinghard-decision decodingiterative decodingerror-correction performance
0
0 comments X

The pith

Product codes gain up to 0.8 dB by marking bits with reliabilities updated each iteration.

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

The paper introduces a soft-aided hard-decision decoder for product codes that marks unreliable bits using reliabilities refreshed at every iteration. This approach yields measured gains of 0.8 dB over ordinary iterative bounded-distance decoding and 0.3 dB over an earlier bit-marking method. The decoder stays within the hard-decision framework while incorporating limited soft information to guide the marking step. A reader would care because product codes appear in high-speed optical and storage systems where small SNR improvements translate directly into reach or power savings.

Core claim

The central claim is that bit marking performed with reliabilities that are recomputed after each decoding iteration produces a soft-aided hard-decision decoder for product codes that outperforms both standard iterative bounded-distance decoding and the authors' prior bit-marking decoder, with the stated gains demonstrated in simulation.

What carries the argument

bit marking via updated reliabilities at each decoding iteration, which supplies the soft information used to decide which bits to mark as unreliable before the next bounded-distance step.

If this is right

  • The decoder remains a hard-decision method yet extracts extra coding gain from soft channel information.
  • Performance improves by as much as 0.8 dB relative to plain iterative bounded-distance decoding.
  • An additional 0.3 dB is obtained over the authors' earlier bit-marking decoder.
  • The method is applicable to product codes used in optical and data-storage links.

Where Pith is reading between the lines

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

  • The same marking rule might be tested on other algebraic code families such as staircase or braided codes.
  • If the reliability-update step can be approximated with low-precision arithmetic, hardware cost could stay close to pure hard-decision implementations.
  • The approach leaves open whether the same iterative marking idea extends to non-product concatenated codes.

Load-bearing premise

The mechanism of marking bits with reliabilities refreshed at every iteration produces the reported gains without raising complexity or creating error floors in the tested cases.

What would settle it

A simulation run at the same code parameters that shows either zero net gain or an earlier error floor when the reliability-update marking step is added would falsify the performance claim.

Figures

Figures reproduced from arXiv: 1906.09792 by Alex Alvarado, Alireza Sheikh, Gabriele Liga.

Figure 2
Figure 2. Figure 2: Schematic diagram of one iteration of the proposed SABM-SR [PITH_FULL_IMAGE:figures/full_fig_p002_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: BER vs. Eb/N0 for the decoding schemes analysed and for a code rate R=0.78. The SABM decoder (red curve) shows a 0.5 dB coding gain compared to iBDD (blue line) at a BER of 10−7 . SABM also outperforms ideal iBDD (dashed-dotted black line), due to its capability to also mitigate failures. SABM-SR gains 0.3 dB over SABM and an overall 0.8 dB compared to iBDD. This substantial coding gain comes at expense of… view at source ↗
read the original abstract

We introduce a novel soft-aided hard-decision decoder for product codes adopting bit marking via updated reliabilities at each decoding iteration. Gains up to 0.8 dB vs. standard iterative bounded distance decoding and up to 0.3 dB vs. our previously proposed bit-marking decoder are demonstrated.

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

0 major / 2 minor

Summary. The manuscript introduces a novel soft-aided hard-decision decoder for product codes that performs bit marking based on reliabilities updated at each iteration. It reports simulation results showing gains of up to 0.8 dB versus standard iterative bounded-distance decoding and up to 0.3 dB versus a prior bit-marking decoder, using product codes constructed from BCH components together with the explicit update rule and iteration schedule.

Significance. If the reported gains hold under the stated conditions, the decoder supplies a modest but practical improvement to the performance-complexity tradeoff for product-code decoding in high-speed links. The manuscript supplies the necessary implementation details (update rule, code parameters, Monte-Carlo curves) that make the central empirical claim reproducible and falsifiable.

minor comments (2)
  1. [Abstract] Abstract: the stated dB gains are given without reference to the operating BER, code length, or channel model; although these details appear in the body, a single qualifying clause would make the abstract self-contained.
  2. [Section 4] Section 4 (simulation results): the number of Monte-Carlo trials and any error-bar information should be stated explicitly so that the statistical reliability of the 0.8 dB and 0.3 dB deltas can be assessed directly from the text.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive summary, significance assessment, and recommendation of minor revision. No major comments were listed in the report, so we have no specific points to address point-by-point. We are prepared to make any minor adjustments requested by the editor.

Circularity Check

0 steps flagged

Minor self-citation to prior decoder; no derivation chain present

full rationale

The manuscript presents an empirical decoder improvement whose central claims are Monte-Carlo simulation gains (0.8 dB and 0.3 dB) against external baselines and a previously published bit-marking rule by the same authors. No equations, first-principles derivations, uniqueness theorems, or fitted-parameter predictions appear in the supplied text. The single self-citation is limited to naming the baseline decoder and does not supply any load-bearing justification for the reported performance; the results remain externally falsifiable. Consequently the paper exhibits only the minor self-citation pattern and receives a low circularity score.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

The abstract supplies no information on free parameters, axioms, or invented entities.

pith-pipeline@v0.9.0 · 5567 in / 1072 out tokens · 32484 ms · 2026-05-25T17:25:09.648249+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

21 extracted references · 21 canonical work pages · 1 internal anchor

  1. [1]

    Elias: `Error-Free Coding', Trans

    P. Elias: `Error-Free Coding', Trans. IRE Professional Group on Information Theory, 1954, 4, (4), pp 29--37

    work page 1954

  2. [2]

    B. P. Smith, A. Farhood, A. Hunt, et al.: `Staircase Codes: FEC for 100 Gb/s OTN', IEEE Journal of Lightwave Technology, 2012, 30, (1), pp 110--117

    work page 2012

  3. [3]

    H\" a ger, and H

    C. H\" a ger, and H. D. Pfister: `Approaching Miscorrection-Free Performance of Product Codes With Anchor Decoding', IEEE Transactions on Communications, 2017, 66, (7), pp 2797--2808

    work page 2017

  4. [4]

    Binary Message Passing Decoding of Product Codes Based on Generalized Minimum Distance Decoding

    A. Sheikh, A. G. i Amat, and G. Liva: `Binary Message Passing Decoding of Product Codes Based on Generalized Minimum Distance Decoding', 2019, available online: http://arxiv.org/abs/1901.02914

    work page internal anchor Pith review Pith/arXiv arXiv 2019

  5. [5]

    Y. Lei, A. Alvarado, B. Chen, et al.: `Decoding Staircase Codes with Marked Bits,' Proc. International Symposium on Turbo Codes and Iterative Information Processing (ISTC), Hong Kong, China, 2018

    work page 2018

  6. [6]

    Sheikh, A

    A. Sheikh, A. G. i. Amat, G. Liva: `Iterative Bounded Distance Decoding of Product Codes with Scaled Reliability', Proc. European Conference on Optical Communications, Rome, Italy, 2018

    work page 2018

  7. [7]

    Sheikh, A

    A. Sheikh, A. G. i. Amat, G. Liva, et al.: `On Low-complexity Decoding of Product Codes for High-throughput Fiber Optic Systems', Proc. IEEE 10th International Symposium on Turbo Codes and Iterative Information Processing (ISTC), Hong Kong, China, 2018

    work page 2018

  8. [8]

    Fougstedt, A

    C. Fougstedt, A. Sheikh, A. Graell i Amat, et al.: `Energy-efficient soft-assisted product decoders', Proc. Optical Fiber Communciations Conference and Exposition (OFC), San Diego, USA, 2019

    work page 2019

  9. [9]

    Y. Lei, B. Chen, G. Liga, et al.: `Improved Decoding of Staircase Codes: The Soft-aided Bit-marking (SABM) Algorithm', 2019, available online: http://www.arxiv.org/abs/1902.01178

    work page arXiv 2019

  10. [10]

    R. M. Pyndiah: `Near--Optimum Decoding of Product Codes: Block Turbo Codes', IEEE Transactions on Communications, 1998, 46, (8), 1003--1010

    work page 1998

  11. [11]

    Poggiolini, G

    P. Poggiolini, G. Bosco, A. Carena, et al.: `A Simple and Effective Closed-form GN Model Correction Formula Accounting for Signal Non-Gaussian Distribution', Journal of Lightwave Technology, 2015, 33, (2), 459--473

    work page 2015

  12. [12]

    (Ed.): `Handbook of Systems Biology' (IEE Press, 2004, 1st edn.), pp

    Hodges, A., Smith, N.: `The title of the book chapter', in Brown, S. (Ed.): `Handbook of Systems Biology' (IEE Press, 2004, 1st edn.), pp. 1--7

    work page 2004

  13. [13]

    Harrison, E.A., and Abbott, C.: `The title of the book' (XYZ Press, 2005, 2nd edn. 2006)

    work page 2005

  14. [14]

    British Patent 123456, July 2004

    Brown, F.: `The title of the patent (if available)'. British Patent 123456, July 2004

    work page 2004

  15. [15]

    IET., `Report Title' (Publisher, 2013), pp. 1-5

    work page 2013

  16. [16]

    BS1234: `The title of the standard', 2006

    work page 2006

  17. [17]

    PhD thesis, XYZ University, 2005

    Abbott, N.L.: `The title of the thesis'. PhD thesis, XYZ University, 2005

    work page 2005

  18. [18]

    `Author Guide - IET Research Journals', http://digital-library.theiet.org/journals/author-guide, accessed 27 November 2014

    work page 2014

  19. [19]

    theiet.org/files/research journals length policy.pdf, accessed 27 November 2014

    `Research journal length policy', http://digital-library. theiet.org/files/research journals length policy.pdf, accessed 27 November 2014

    work page 2014

  20. [20]

    `ORCID: Connecting research and researchers', http://orcid.org/, accessed 3 December 2014

    work page 2014

  21. [21]

    `Fundref', http://www.crossref.org/fundref/, accessed 4 December 2014 footnotesize

    work page 2014