{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:58:22Z","timestamp":1773377902900,"version":"3.50.1"},"reference-count":17,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9517939","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"256-261","source":"Crossref","is-referenced-by-count":5,"title":["New upper bounds for (b, k)-hashing"],"prefix":"10.1109","author":[{"given":"Stefano Della","family":"Fiore","sequence":"first","affiliation":[{"name":"University of Brescia,Department of Information Engineering"}]},{"given":"Simone","family":"Costa","sequence":"additional","affiliation":[{"name":"University of Brescia,Department of Information Engineering"}]},{"given":"Marco","family":"Dalai","sequence":"additional","affiliation":[{"name":"University of Brescia,Department of Information Engineering"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Beating Fredman-Komlos for perfect k-hashing","author":"guruswami","year":"0","journal-title":"Leibniz International Proceedings in Informatics (2019)"},{"key":"ref11","first-page":"6037","article-title":"Nombre minimal de contacts de fermature nécessaires pour réaliser une fonction booléenne symétrique de n variables","author":"hansel","year":"1964","journal-title":"C R Acad Sci Paris"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/S0195-6698(88)80048-9"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/0607062"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548300001280"},{"key":"ref15","author":"radhakrishnan","year":"0","journal-title":"Entropy and counting"},{"key":"ref16","article-title":"Beating the probabilistic lower bound on perfect hashing","author":"xing","year":"2019","journal-title":"ArXiv Preprint"},{"key":"ref17","article-title":"Improved Bounds for (b, k)-hashing","author":"della fiore","year":"2021","journal-title":"ArXiv Preprint"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437609"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.1994.394704"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006811"},{"key":"ref5","author":"costa","year":"0","journal-title":"New bounds for perfect k-hashing in press on Discrete Applied Mathematics 2020"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/18.21233"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2933424"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.335947"},{"key":"ref1","first-page":"139","volume":"83","author":"aaltonen","year":"1990","journal-title":"A new upper bound on nonbinary block codes Discrete Math"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/0605009"}],"event":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","location":"Melbourne, Australia","start":{"date-parts":[[2021,7,12]]},"end":{"date-parts":[[2021,7,20]]}},"container-title":["2021 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9517708\/9517709\/09517939.pdf?arnumber=9517939","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:31Z","timestamp":1773347731000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9517939\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9517939","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}