Fig. 2From: An improved algorithm based on Bloom filter and its application in bar code recognition and processingThe error rate desired as a function of the size of the Bloom filter (bits/entry). The number of hash functions is k. The curve represents the relation between error rate and the size of Bloom filter (bits/entry) under the premise of setting the number of hash functionsBack to article page