The computation capacity for reliable recovery of Boolean functions from a known class via channels is formulated and shown to have tight scaling behavior for classes characterized by Hamming weight.
Deterministic Identification Over Channels With Finite Output: A Dimensional Perspective on Superlinear Rates,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Beyond Identification: Computing Boolean Functions via Channels
The computation capacity for reliable recovery of Boolean functions from a known class via channels is formulated and shown to have tight scaling behavior for classes characterized by Hamming weight.