Entropic Generation of Binary Words
This paper introduces a novel algorithm for generating k Hamming weight binary words in linear time while minimizing random bit consumption.
The paper introduces a novel paradigm called random bit recycling, which is used to generate k Hamming weight binary words in linear time.
Before reading this…
Applications
- →Cryptography
- →Random number generation
To understand this paper, make sure you know these concepts first:
- Information theoryfind papers →
- Random number generationfind papers →
Abstract
More Like ThisThe uniform generation of k Hamming weight binary words, equivalent to sampling k-subsets from n elements, relies on random bits, which can be expensive. We introduce a novel paradigm, random bit recycling, and use it to generate such binary words in linear time while consuming as few random bits as possible. The resulting algorithm is nearly optimal in terms of random bit consumption, meaning that it closely matches the Shannon entropic lower bound coming from information theory.