Low power logic for statistical inference
Proceedings of the 16th ACM/IEEE international symposium on Low power electronics and design
| Hi-index | 0.00 |
The behavior of a computation system consisting of encoders, an unreliable logical operator and a decoder is investigated. It is shown that for almost all Boolean functions, coding each block of k input bits into a block of n bits such that all sets of s or less errors will be corrected requires that n ≥ (2s + 1)k. This result suggests that the capacity (in the information theoretical sense) of such a computation system is zero.