Beating Fredman-Koml\'{o}s for perfect $k$-hashing

G. Hansel, “Nombre minimal de contacts de fermature nécessaires pour réaliser une fonction booléenne symétrique de n n variables,” C. R. Acad. Sci. Paris , pp. 6037–6040, 1964

1964

Earlier work this paper cites.

J. Körner, “Coding of an information source having ambiguous alphabet and the entropy of graphs,” 6th Prague Conference on Information Theory , pp. 411–425, 1973

1973

Earlier work this paper cites.

M. L. Fredman and J. Komlós, “On the size of separating systems and families of perfect hash functions,” SIAM Journal on Algebraic Discrete Methods , vol. 5, no. 1, pp. 61–68, mar 1984. [Online]. Available: https://doi.org/10.1137%2F0605009

1984

Earlier work this paper cites.

J. Körner, “Fredman–Komlós bounds and information theory,” SIAM Journal on Algebraic Discrete Methods , vol. 7, no. 4, pp. 560–570, oct 1986. [Online]. Available: https://doi.org/10.1137%2F0607062

1986

Earlier work this paper cites.

P. Elias, “Zero error capacity under list decoding,” IEEE Trans. Information Theory , vol. 34, no. 5, pp. 1070–1074, 1988. [Online]. Available: https://doi.org/10.1109/18.21233

1988

Earlier work this paper cites.

J. Körner and K. Marton, “New bounds for perfect hashing via information theory,” European Journal of Combinatorics , vol. 9, no. 6, pp. 523–530, nov 1988. [Online]. Available: https://doi.org/10.1016%2Fs0195-6698%2888%2980048-9

1988

Cited alongside, same era.

E. Arikan, “A bound on the zero-error list coding capacity,” in Proceedings. IEEE International Symposium on Information Theory . IEEE. [Online]. Available: https://doi.org/10.1109%2Fisit.1993.748467

1993

Cited alongside, same era.

A. Nilli, “Perfect hashing and probability,” Combinatorics, Probability and Computing , vol. 3, no. 03, pp. 407–409, sep 1994. [Online]. Available: https://doi.org/10.1017%2Fs0963548300001280

1994

Cited alongside, same era.

E. Arikan, “An upper bound on the zero-error list-coding capacity,” IEEE Transactions on Information Theory , vol. 40, no. 4, pp. 1237–1240, jul 1994. [Online]. Available: https://doi.org/10.1109%2F18.335947

1994

Cited alongside, same era.

J. Radhakrishnan, “Entropy and counting,” 2001

2001

Later among the works it cites.

E. Ok, Real analysis with economic applications . Princeton University Press, 9 2011

2011

Later among the works it cites.

M. Dalai, V. Guruswami, and J. Radhakrishnan, “An improved bound on the zero-error list-decoding capacity of the 4/3 channel,” in 2017 IEEE International Symposium on Information Theory (ISIT) , June 2017, pp. 1658–1662

2017

Later among the works it cites.

W. R. Inc., “Mathematica, Version 11.3,” champaign, IL, 2018

2018

Closest in time.