A weight-distribution bound for entropy extractors using linear binary codes

2014/05/12 by Alessio Meneghetti, Massimiliano Sala, Meneghetti, Alessio +3
Computer Science · Mathematics · #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #Probability (math.PR) #cs.IT #math.IT #math.PR

paper · pdf · doi:10.48550/arxiv.1405.2820

10 pages, 2 figures. submitted to IEEE

arxiv created 2014/05/12 · arxiv updated 2014/05/13

Abstract

We consider a bound on the bias reduction of a random number generator by processing based on binary linear codes. We introduce a new bound on the total variation distance of the processed output based on the weight distribution of the code generated by the chosen binary matrix. Starting from this result we show a lower bound for the entropy rate of the output of linear binary extractors.

Related

• Entropy Distance
• Binary linear code weight distribution estimation by random bit stream compression
• An Entropy Lower Bound for Non-Malleable Extractors
• Analytical Bounds between Entropy and Error Probability in Binary Classifications
• Minimum MS. E. Gerber's Lemma