Jump to:  Browse | Search | Email 

Browse:  most popular entries | oldest entries | most recent entries 

Information Theory, Inference, and Learning Algorithms > Information Theory > Hash codes, cryptography, cryptanalysis

subsection 21.2 of ITILA you say that "M is typically chosen such that [...] 2^M is is a little bigger than S - say, ten times bigger", and in the next sentence for S of about 1 million you suggest setting M to 30, which gives 2^30 ~ 10^9, which is a thousand, not ten, times bigger than S.

Exercise 15.3 (hash codes). You seem to be measuring hash code performance in terms of proportion of pairs of entries which collide. Yet towards the end of the solution you say "...collisions, involving a fraction f of the names". Surely the fraction of the names involved in collisions is not the same as the fraction of pairs which collide, since more than 2 entries might be involved in the same collision? Wouldn't the "fraction of names" measure in fact me a more useful one?

Showing 1 to 2 of 2 entries