Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Does anyone have any good intuition for a good hash function for a sparse bit vector? To give a concrete example, say I want to hash a 4096 bit integer where the probability of each bit being 1 is 10%.
I want to get some compression in the hash. For example 4096 bits in and 32 bits out. This is just an example to illustrate what I am looking for. Of course, all answers are very much appreciated.
Would a Bloom filter help?
If the bit vector is 2^32 bits, then why not just use a 32 bit integer?