We know that: trevisan's extractor based on min entropy of the relative system. For trevisan extractor, we need source, seed, min entropy value per bit and error rate for per bit I have the code for trevisan's extractor and if entropy is small, extractor is working very slow, if entropy is big extractor is working quite fast.
In that case,Does it mean that: to have small min entropy means more randomness and advantage for randomness?
Or randomness is just related to error rate per bits and it is not related to min entropy valu per bits?
And I am using this guideline Trevisan Extractor