{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T13:08:44Z","timestamp":1783170524632,"version":"3.54.6"},"reference-count":26,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T00:00:00Z","timestamp":1711929600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T00:00:00Z","timestamp":1711929600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T00:00:00Z","timestamp":1711929600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Project SERICS through the National Recovery and Resilience Plan Ministry of University and Education (NRRP MUR) Program"},{"name":"Next Generation European Union","award":["PE00000014"],"award-info":[{"award-number":["PE00000014"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2024,4]]},"DOI":"10.1109\/tit.2023.3316435","type":"journal-article","created":{"date-parts":[[2023,9,18]],"date-time":"2023-09-18T17:48:53Z","timestamp":1695059333000},"page":"2456-2463","source":"Crossref","is-referenced-by-count":2,"title":["Improved Algorithms and Bounds for List Union-Free Families"],"prefix":"10.1109","volume":"70","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9124-610X","authenticated-orcid":false,"given":"Adele A.","family":"Rescigno","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Salerno, Fisciano, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4085-7300","authenticated-orcid":false,"given":"Ugo","family":"Vaccaro","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Salerno, Fisciano, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006950"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480103431071"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.1996.0041"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702405292"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-006-6528-z"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703428002"},{"issue":"3","key":"ref7","first-page":"158","article-title":"Bounds on the length of disjunctive codes","volume":"18","author":"D\u2019yachkov","year":"1982","journal-title":"Problemy Peredachi Informatsii"},{"issue":"4","key":"ref8","first-page":"237","article-title":"Superimposed distance codes","volume":"18","author":"D\u2019yachkov","year":"1989","journal-title":"Problems Control Inform. Theory"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1142\/SAM"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/BF02772959"},{"key":"ref11","first-page":"10387","article-title":"Superset technique for approximate recovery in one-bit compressed sensing","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NeurIPS)","volume":"32","author":"Flodin"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.1996.0012"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2018.12.002"},{"key":"ref14","first-page":"45","article-title":"A survey of cover-free families: Constructions, applications and generalizations","volume-title":"Stinson66\u2014New Advances in Designs, Codes and Cryptography","author":"Idalino","year":"2023"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057020"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48405-1_38"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(97)80002-9"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2023.3332084"},{"key":"ref19","first-page":"1","article-title":"Support recovery in universal one-bit compressed sensing","volume-title":"Proc. 13th Innov. Theor. Comput. Sci. Conf. (ITCS)","author":"Mazumdar"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1667053.1667060"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22006-7_47"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2163296"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(94)90067-1"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2614726"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(03)00287-5"},{"key":"ref26","volume-title":"Efficient Data Structures From Union-Free Families of Sets","author":"de Wolf","year":"2012"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/10475890\/10254335.pdf?arnumber=10254335","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,27]],"date-time":"2024-03-27T19:57:25Z","timestamp":1711569445000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10254335\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4]]},"references-count":26,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tit.2023.3316435","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4]]}}}