{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:41:25Z","timestamp":1773376885066,"version":"3.50.1"},"reference-count":26,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T00:00:00Z","timestamp":1720310400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T00:00:00Z","timestamp":1720310400000},"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":[[2024,7,7]]},"DOI":"10.1109\/isit57864.2024.10619541","type":"proceedings-article","created":{"date-parts":[[2024,8,19]],"date-time":"2024-08-19T13:25:01Z","timestamp":1724073901000},"page":"2610-2615","source":"Crossref","is-referenced-by-count":0,"title":["Upper Bounds on the Rate of Linear Q-Ary K-Hash Codes"],"prefix":"10.1109","author":[{"given":"Stefano Della","family":"Fiore","sequence":"first","affiliation":[{"name":"University of Salerno,Department of Computer Science"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Dalai","sequence":"additional","affiliation":[{"name":"University of Brescia,Department of Information Engineering"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/0605009"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/S0195-6698(88)80048-9"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.335947"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.1998.2876"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3167608"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2021.3111455"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.1997.613089"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.exco.2022.100051"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.exco.2024.100139"},{"key":"ref10","article-title":"Improved upper bound for the size of a trifferent code","author":"Bhandari","year":"2024","journal-title":"arXiv preprint"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.1994.394704"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2933424"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2020.11.001"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2021.105580"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517939"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-023-00014-x"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2020.105335"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3183619"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1112\/jlms.12938"},{"key":"ref20","first-page":"289","article-title":"On k-arcs covering a line in finite projective planes","volume":"58","author":"Ng","year":"2001","journal-title":"ARS COMBINATORIA-WATERLOO THEN WINNIPEG-"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022424630332"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(77)90001-2"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055688"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(90)90002-Y"},{"issue":"1","key":"ref25","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0097-3165(92)90035-S","article-title":"Polynomial multiplicities over finite fields and intersection sets","volume":"60","author":"Bruen","year":"1992","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008260505585"}],"event":{"name":"2024 IEEE International Symposium on Information Theory (ISIT)","location":"Athens, Greece","start":{"date-parts":[[2024,7,7]]},"end":{"date-parts":[[2024,7,12]]}},"container-title":["2024 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10619013\/10619074\/10619541.pdf?arnumber=10619541","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:28:59Z","timestamp":1773347339000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10619541\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,7]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/isit57864.2024.10619541","relation":{},"subject":[],"published":{"date-parts":[[2024,7,7]]}}}