{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T14:52:33Z","timestamp":1776955953584,"version":"3.51.4"},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"European Union under Italian National Recovery and Resilience Plan (NRRP) of NextGenerationEU, Partnership on \u201cTelecommunications of the Future\u201d through Program \u201cRESTART\u201d","award":["PE00000001"],"award-info":[{"award-number":["PE00000001"]}]},{"name":"\u201cNetwin\u201d Project","award":["CUP E83C22004640001"],"award-info":[{"award-number":["CUP E83C22004640001"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2026,2]]},"DOI":"10.1109\/tit.2025.3648920","type":"journal-article","created":{"date-parts":[[2025,12,26]],"date-time":"2025-12-26T18:23:28Z","timestamp":1766773408000},"page":"865-875","source":"Crossref","is-referenced-by-count":1,"title":["Bounds on\n                    <i>k<\/i>\n                    -Hash Distances and Rates of Linear Codes"],"prefix":"10.1109","volume":"72","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7034-084X","authenticated-orcid":false,"given":"Stefano","family":"Della Fiore","sequence":"first","affiliation":[{"name":"Department of Information Engineering, University of Brescia, Brescia, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2132-7072","authenticated-orcid":false,"given":"Marco","family":"Dalai","sequence":"additional","affiliation":[{"name":"Department of Information Engineering, University of Brescia, Brescia, Italy"}],"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.1109\/isit.1994.394704"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2933424"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2020.11.001"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2021.105580"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517939"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-023-00014-x"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.exco.2022.100051"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.exco.2024.100139"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-024-00130-2"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3183619"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1112\/jlms.12938"},{"key":"ref19","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"},{"key":"ref20","article-title":"The generalized trifference problem","author":"Bishnoi","year":"2025","journal-title":"arXiv:2505.07706"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(90)90002-Y"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/18.21233"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(77)90001-2"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022424630332"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055688"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(92)90035-S"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008260505585"},{"key":"ref29","first-page":"142","article-title":"Coding theorems for a discrete source with a fidelity criterion","volume":"7","author":"Shannon","year":"1959","journal-title":"IRE Nat. Conv. Rec."},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1055985"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541515"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/18\/11361350\/11316451.pdf?arnumber=11316451","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T20:58:03Z","timestamp":1769201883000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11316451\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2]]},"references-count":31,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tit.2025.3648920","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2]]}}}