Sem-OSD injects byte-level LM priors into OSD via fused scoring and dual TEP families, achieving BLER below finite-blocklength bounds and 1.5 dB gain over Fossorier OSD on BCH and RS codes.
Probability-based ordered-statistics decoding for short block codes
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
cs.IT 3verdicts
UNVERDICTED 3representative citing papers
Quasi-BP decoder for BCH codes integrates domain knowledge and mutual information tracking to achieve near-LDPC performance on high-density parity-check matrices.
The authors develop an error pattern tree representation that unifies SGRAND and ORBGRAND, enabling a parallel SGRAND design with ML optimality and an enhanced parallel ORBGRAND variant, with reported speedups of 3.96x and 4.21x respectively.
citing papers explorer
-
Semantic Ordered Statistics Decoding
Sem-OSD injects byte-level LM priors into OSD via fused scoring and dual TEP families, achieving BLER below finite-blocklength bounds and 1.5 dB gain over Fossorier OSD on BCH and RS codes.
-
Quasi-BP for BCH Codes and its Optimization
Quasi-BP decoder for BCH codes integrates domain knowledge and mutual information tracking to achieve near-LDPC performance on high-density parity-check matrices.
-
A Parallelization Strategy for GRAND with Optimality Guarantee by Exploiting Error Pattern Tree Representation
The authors develop an error pattern tree representation that unifies SGRAND and ORBGRAND, enabling a parallel SGRAND design with ML optimality and an enhanced parallel ORBGRAND variant, with reported speedups of 3.96x and 4.21x respectively.