A finite-computation achievability bound for sequential decoding of random tree codes, optimized by a greedy bit-placement rule, approaches the random-coding union and Gallager benchmarks for pure random codes.
Information theory and reliable commun ication,
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
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
support 1representative citing papers
citing papers explorer
-
The Optimization of Random Tree Codes for Limited Computational Resources
A finite-computation achievability bound for sequential decoding of random tree codes, optimized by a greedy bit-placement rule, approaches the random-coding union and Gallager benchmarks for pure random codes.