{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T16:16:24Z","timestamp":1729613784631,"version":"3.28.0"},"reference-count":11,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/isit.2017.8007008","type":"proceedings-article","created":{"date-parts":[[2017,8,29]],"date-time":"2017-08-29T18:54:37Z","timestamp":1504032877000},"page":"2643-2647","source":"Crossref","is-referenced-by-count":2,"title":["Improved codes for list decoding in the Levenshtein's channel and information retrieval"],"prefix":"10.1109","author":[{"given":"Tero","family":"Laihonen","sequence":"first","affiliation":[]},{"given":"Tuomo","family":"Lehtila","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2522434"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283016"},{"journal-title":"Covering Codes","year":"1997","author":"cohen","key":"ref10"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2508800"},{"journal-title":"The Theory of Error-Correcting Codes","year":"1977","author":"macwilliams","key":"ref11"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620351"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2191934"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2290045"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.904499"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"14","DOI":"10.37236\/1451","article-title":"New bounds for codes identifying vertices in graphs","volume":"6","author":"cohen","year":"1999","journal-title":"Electron J Combin"},{"journal-title":"On t-revealing codes in binary Hamming spaces","year":"0","author":"laihonen","key":"ref1"}],"event":{"name":"2017 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2017,6,25]]},"location":"Aachen, Germany","end":{"date-parts":[[2017,6,30]]}},"container-title":["2017 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7999336\/8006474\/08007008.pdf?arnumber=8007008","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,16]],"date-time":"2020-10-16T14:58:17Z","timestamp":1602860297000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8007008\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/isit.2017.8007008","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}