1. New bounds for perfect hashing via information theory;Kőrner;European J. Combin.,1988
2. Fredman and jános komlós, on the size of separating systems and families of perfect hash functions;Michael;SIAM J. Algebraic Discret. Methods,1984
3. An upper bound on the zero-error list-coding capacity;Arikan;IEEE Trans. Inform. Theory,1994
4. E. Arikan, An improved graph-entropy bound for perfect hashing, in: IEEE International Symposium on Information Theory, 1994.
5. An improved bound on the zero-error listdecoding capacity of the 4/3 channel;Dalai;IEEE Trans. Inform. Theory,2020