1 paper · 1 filter
Olivier Bodini, Francis Durand
The 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 parad…