Arıkan, Erdal2016-02-082016-02-081994-06-072157-8095http://hdl.handle.net/11693/27775Date of Conference: 27 June-1 July 1994Conference Name: International Symposium on Information Theory, IEEE 1994Gives an improved graph-entropy bound on the size of families of perfect hash functions. Examples are given illustrating that the new bound improves previous bounds in several instances.EnglishUpper boundInformation theoryCombinatorial mathematicsUSA CouncilsConference Paper10.1109/ISIT.1994.394704