AI & ML
Iterative Bounded Distance Decoding With 2-Bit Reliability Marker For Product-Like Codes
arXiv math.IT0 views
arXiv:2610.21279v1 Announce Type: new 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.
Source:https://arxiv.org/abs/2610.21279PreviousOn the Subadditivity of Mutual f-InformationNextOn the structure of polynomial ideal codes and additive Reed--Solomon codes
Related posts
The world has a new plan to save nature, but it still needs the money
0Ars Technica

Could data center backlash flip Florida?
0The Verge

Vivo’s first Pro Max phone proves its Ultra is still in a league of its own
0The Verge

Why Peacock is making a huge bet on YouTube
0The Verge
Ninja’s first-ever microwave just replaced two of my kitchen appliances at once
0TechCrunch
Marvell and Lumentum sign definitive 115 billion dollars all-stock merger to build an AI-connectivity leader
0dev.to