The work gives non-asymptotic achievability bounds on expected decoding time for posterior matching over BMS channels and a polynomial-complexity encoder that enforces SED partitions via lattice grouping and batched correction.
Data transmission over a discrete chan nel with feedback: Random transmission time
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
support 1representative citing papers
citing papers explorer
-
Posterior Matching over Binary-Input Memoryless Symmetric Channels: Non-Asymptotic Bounds and Low-Complexity Encoding
The work gives non-asymptotic achievability bounds on expected decoding time for posterior matching over BMS channels and a polynomial-complexity encoder that enforces SED partitions via lattice grouping and batched correction.