Bloom filters

[a dot self]

In my next assignment I will need to implement a superTable class which consist of a hashTable and a bloom filter to optimize search queries. After some research I realized I will need to implement a counting filer to account for deletions of a given element from the hashTable.I chose a counting bloom filter because it seems most appropriate. Though there were other filters such as, a ranked-indexed filter it seemed to difficult for me to implement at the moment.

A counting bloom filter is an array of n-bits vs the static one bit array.

Does anyone know of bloom filter implementation which can yield greater accuracy results reducing false positives?

Is my idea of a counting bloom filter correct?
eg. this is what i think it means by n-bits

-----------------------------------------------
intx|intx|intx|int x|int x|intx|intx|intx|```///when an element hashes to
----------------------------------------------- `/// a specific array index
`0```1``2``3```4```5```6```7```/// update the counter x?

Feedback would greatly be appreciated. Thanks for your time.