Benefits of Compressed Bloom Filters Array bits per elt. m/n 8 14 92 Trans.Bits per elt. z/n 8 7.923 7.923 Hash functions k 6 2 1 False positive rate 0.0216 0.0177 0.0108 Array bits per elt. m/n 16 28 48 Trans.Bits per elt. z/n 16 15.846 15.829 Hash functions k 11 4 3 False positive rate 4.59E-043.14E-04 2.22E-04 Examples for bounded transmission size. ■ 20-50%of false positive rate. 2121 Benefits of Compressed Bloom Filters  Examples for bounded transmission size.  20-50% of false positive rate. Array bits per elt. m/n 8 14 92 Trans. Bits per elt. z/n 8 7.923 7.923 Hash functions k 6 2 1 False positive rate f 0.0216 0.0177 0.0108 Array bits per elt. m/n 16 28 48 Trans. Bits per elt. z/n 16 15.846 15.829 Hash functions k 11 4 3 False positive rate f 4.59E-04 3.14E-04 2.22E-04