Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 11 min ago
PreprintarXiv licencearXiv

Iterative Bounded Distance Decoding With 2-Bit Reliability Marker For Product-Like Codes

  • Xiaowei Wu
  • Min Qiu
  • Yueying Zhan
  • Lei Yang
Open at sourcePDFDOICite

Abstract

We propose a novel soft-aided hard-decision decoding scheme for product codes based on two-bit quantized reliability markers. In particular, one bit is used for a two-level tolerance miscorrection check to validate the bounded distance decoding (BDD) result, while the other identifies bits to be randomly flipped upon BDD failure and miscorrection. List decoding is incorporated to further facilitate the error performance. Density evolution is performed for the design of the quantization thresholds. Compared to iterative BDD, the proposed scheme requires only moderate increases in memory and computational overhead. Simulation results verify that our scheme outperforms several unquantized soft-aided decoders, while maintaining small memory costs and low BDD attempts.

Related

  1. Dual lattice attacks for bounded distance decoding, revisited
    Thijs Laarhoven
    arXivPreprintCC BY-SA 4.0Full textGeometry & topologyarXiv
  2. Study of Iterative Detection and Decoding for {Mixed Near- and Far-Field} XL-MIMO Systems
    Nayyab Haider, Rodrigo C. de Lamare
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  3. On the Multi-Weight Shift-Sum Iterative Decoding of Short BCH Codes
    Yinglei Yang, Di Zhang, Aimin Li +3
    arXivPreprintCC BY 4.0Full textGeneral mathematicsarXiv
  4. Third-order Halley-type iterative method with positive and bounded correction function
    Hirai Mukasa
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
  5. Iterative Semantic Decoding for Short Block Codes
    Jiafu Hao, Chentao Yue, Mingcheng Nie +2
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv

Cite

BibTeXRIS
BibTeX
@misc{wu2026iterative,
  title = {{Iterative Bounded Distance Decoding With 2-Bit Reliability Marker For Product-Like Codes}},
  author = {Xiaowei Wu and Min Qiu and Yueying Zhan and Lei Yang},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.21279},
  eprint = {2610.21279},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.21279},
}
RIS
TY  - UNPB
TI  - Iterative Bounded Distance Decoding With 2-Bit Reliability Marker For Product-Like Codes
AU  - Xiaowei Wu
AU  - Min Qiu
AU  - Yueying Zhan
AU  - Lei Yang
PY  - 2026
DA  - 2026/10/15
PB  - arXiv
DO  - 10.48550/arxiv.2610.21279
UR  - https://arxiv.org/abs/2610.21279
AB  - We propose a novel soft-aided hard-decision decoding scheme for product codes based on two-bit quantized reliability markers. In particular, one bit is used for a two-level tolerance miscorrection check to validate the bounded distance decoding (BDD) result, while the other identifies bits to be randomly flipped upon BDD failure and miscorrection. List decoding is incorporated to further facilitate the error performance. Density evolution is performed for the design of the quantization thresholds. Compared to iterative BDD, the proposed scheme requires only moderate increases in memory and computational overhead. Simulation results verify that our scheme outperforms several unquantized soft-aided decoders, while maintaining small memory costs and low BDD attempts.
ER  -