CDF-ORBGRAND exactly achieves the symmetric capacity for binary-input memoryless channels under symmetric inputs and the BICM capacity in bit-interleaved coded modulation.
ORBGRAND is almost capacity-achieving,
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.IT 2years
2025 2verdicts
UNVERDICTED 2representative citing papers
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
-
ORBGRAND Is Exactly Capacity-achieving via Rank Companding
CDF-ORBGRAND exactly achieves the symmetric capacity for binary-input memoryless channels under symmetric inputs and the BICM capacity in bit-interleaved coded modulation.
-
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.