Entropic Generation of Binary Words
Electronic Proceedings in Theoretical Computer Science · 2026-06-07 · 445 · 38-46
DOI: 10.4204/eptcs.445.6 ↗At a glance
Journal article in Electronic Proceedings in Theoretical Computer Science, published online on 2026-06-07. Written by Olivier Bodini and 1 co-authors. 13 references.
Abstract (original language)
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 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.
Cite
APA
Bodini, O., & Durand, F. (2026). Entropic Generation of Binary Words. Electronic Proceedings in Theoretical Computer Science, 445, 38-46. https://doi.org/10.4204/eptcs.445.6
Vancouver
Bodini O, Durand F. Entropic Generation of Binary Words. Electronic Proceedings in Theoretical Computer Science. 2026;445:38-46. doi:10.4204/eptcs.445.6
BibTeX
@article{Bodini2026,
author = {Bodini, Olivier and Durand, Francis},
title = {Entropic Generation of Binary Words},
journal = {Electronic Proceedings in Theoretical Computer Science},
year = {2026},
volume = {445},
pages = {38--46},
doi = {10.4204/eptcs.445.6}
}
EUVIMED