Interestingly, CRC32C is a bijective function over 4 byte integers. More generally, any perfect minimal hashing function could be used to map a set of N intege

Interestingly, CRC32C is a bijective function over 4 byte integers. More generally, any perfect minimal hashing function could be used to map a set of N integers to the numbers 1 through N.