Capacity-achieving codes for additive noise channels over finite fields admit linear-size arithmetic encoders of inverse-Ackermann depth.
A mathematical theory of communication
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Capacity-Achieving Codes with Inverse-Ackermann-Depth Encoders
Capacity-achieving codes for additive noise channels over finite fields admit linear-size arithmetic encoders of inverse-Ackermann depth.