{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T05:46:55Z","timestamp":1729662415431,"version":"3.28.0"},"reference-count":24,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1109\/isit.2009.5206019","type":"proceedings-article","created":{"date-parts":[[2009,8,24]],"date-time":"2009-08-24T15:09:52Z","timestamp":1251126592000},"page":"2547-2551","source":"Crossref","is-referenced-by-count":0,"title":["An optimal result for codes identifying sets of words"],"prefix":"10.1109","author":[{"given":"Svante","family":"Janson","sequence":"first","affiliation":[]},{"given":"Tero","family":"Laihonen","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928263"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2005.05.030"},{"year":"0","key":"17"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2004.830895"},{"key":"18","article-title":"identifying codes and the set cover problem","author":"laifenfeld","year":"2006","journal-title":"Proceedings of the 44th Annual Allerton Conf on Communication Control and Computing"},{"year":"0","key":"24"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.2002.3263"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/18.661507"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2004.09.005"},{"key":"14","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1023\/A:1011256721935","article-title":"on codes identifying sets of vertices in hamming space","volume":"24","author":"honkala","year":"2001","journal-title":"Des Codes Cryptogr"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2007.09.017"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2006.07.041"},{"journal-title":"Identifying and Locating-Dominating Codes in Graphs A Bibliography","year":"0","author":"lobstein","key":"21"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1520-6610(2000)8:2<151::AID-JCD8>3.0.CO;2-S"},{"year":"0","key":"20"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480104444089"},{"key":"1","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1086\/358439","article-title":"a rare pamphlet of moivre and some of his discoveries","volume":"8","author":"archibald","year":"1926","journal-title":"Isis"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2009.09.002"},{"journal-title":"Covering Codes","year":"1997","author":"cohen","key":"7"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2005.09.027"},{"key":"5","doi-asserted-by":"crossref","DOI":"10.37236\/934","article-title":"structural properties of twin-free graphs","volume":"14","author":"charon","year":"2007","journal-title":"Electron J Combin"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2005.11.007"},{"year":"0","key":"9"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2009.02.004"}],"event":{"name":"2009 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2009,6,28]]},"location":"Seoul, South Korea","end":{"date-parts":[[2009,7,3]]}},"container-title":["2009 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5179947\/5205248\/05206019.pdf?arnumber=5206019","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,21]],"date-time":"2020-05-21T18:03:17Z","timestamp":1590084197000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5206019\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/isit.2009.5206019","relation":{},"subject":[],"published":{"date-parts":[[2009,6]]}}}