{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:42:34Z","timestamp":1773376954254,"version":"3.50.1"},"reference-count":49,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"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":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195687","type":"proceedings-article","created":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:48:08Z","timestamp":1760982488000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Binary Variable-Length Codes with a Bounded Number of 1's Per Codeword: Design, Analysis, and Applications"],"prefix":"10.1109","author":[{"given":"Roberto","family":"Bruno","sequence":"first","affiliation":[{"name":"University of Salerno,Department of Computer Science,Fisciano,SA,Italy"}]},{"given":"Roberto","family":"De Prisco","sequence":"additional","affiliation":[{"name":"University of Salerno,Department of Computer Science,Fisciano,SA,Italy"}]},{"given":"Ugo","family":"Vaccaro","sequence":"additional","affiliation":[{"name":"University of Salerno,Department of Computer Science,Fisciano,SA,Italy"}]}],"member":"263","reference":[{"key":"ref1","volume-title":"Search Problems","author":"Ahlswede","year":"1987"},{"key":"ref2","volume-title":"Combinatorial Search","author":"Aigner","year":"1988"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539798343908"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1644015.1644032"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(82)90005-8"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(94)90101-5"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-82014-4_7"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3428699"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055218"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007616604496"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(94)00193-3"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.2000.1717"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1142\/SAM"},{"key":"ref14","article-title":"Poisoned wine bottles, not enough rats - the search for optimal poisoned-wine-bottle codes","volume-title":"Information Theory and Application Workshop","author":"Elser","year":"2014"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/0203008"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1959.tb01583.x"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2005.42"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/509907.510020"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/100794092"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/18.705558"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973068.83"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/JRPROC.1952.273898"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/0121057"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2011.08.003"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/65950.65955"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-7204-2262-7.50028-4"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046244"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1090\/dol\/018"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/BF00264289"},{"key":"ref30","article-title":"The Art of Computer Programming, Volume III","volume-title":"Sorting and Searching","author":"Knuth","year":"1991"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-18088-5_29"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-09526-8_10"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-69672-5"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.2307\/1267917"},{"key":"ref35","volume-title":"Graphs and Questionnaires","author":"Picard","year":"1980"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3095395"},{"key":"ref37","article-title":"Auditing: Active learning with outcome-dependent query costs","volume":"26","author":"Sabato","year":"2013","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2017.12.033"},{"key":"ref39","article-title":"Trading off worst and expected cost in decision tree problems and a value dependent model","author":"Saettler","year":"2014","journal-title":"arXiv preprint"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2015.02.006"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-959-0"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2010.35"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(98)00166-5"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1097\/00004032-197309000-00004"},{"key":"ref45","article-title":"Types of cost in inductive concept learning","author":"Turney","year":"2002","journal-title":"arXiv preprint cs\/0212034"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541496"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(76)90052-1"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1137\/0603055"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2024.114896"}],"event":{"name":"2025 IEEE International Symposium on Information Theory (ISIT)","location":"Ann Arbor, MI, USA","start":{"date-parts":[[2025,6,22]]},"end":{"date-parts":[[2025,6,27]]}},"container-title":["2025 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11195206\/11195207\/11195687.pdf?arnumber=11195687","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:29:34Z","timestamp":1773347374000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195687\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":49,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195687","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}