full-entropy bitstring

A bitstring with ideal randomness (i.e., the amount of entropy per bit is equal to 1). This publication proves that a bitstring satisfying a certain definition of full entropy has an entropy rate of at least \(1-ε\), where \(ε\) is at most \(2^{-32}\).