{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:01:21Z","timestamp":1772283681697,"version":"3.50.1"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1109\/isit.2012.6283016","type":"proceedings-article","created":{"date-parts":[[2012,8,30]],"date-time":"2012-08-30T20:57:57Z","timestamp":1346360277000},"page":"106-110","source":"Crossref","is-referenced-by-count":29,"title":["On the uncertainty of information retrieval in associative memories"],"prefix":"10.1109","author":[{"given":"Eitan","family":"Yaakobi","sequence":"first","affiliation":[]},{"given":"Jehoshua","family":"Bruck","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284053"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2008.11.005"},{"key":"16","first-page":"399","article-title":"Improved string reconstruction over insertion-deletion channels","author":"viswanathan","year":"2008","journal-title":"Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.2000.3081"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2006.11.016"},{"key":"11","first-page":"417","volume":"55","year":"1997","journal-title":"Doklady Mathematics"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/18.904499"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2164891"},{"key":"2","first-page":"903","article-title":"Reconstructing strings from random traces","author":"batu","year":"2004","journal-title":"Proceedings of the Fifteenth Annual ACMSIAM Symposium on Discrete Algorithms"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008394205999"},{"key":"10","first-page":"593","article-title":"Reconstructing objects from a minimal number of distorted patterns","volume":"354","author":"levenshtein","year":"0","journal-title":"Doklady Academii Nauk"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2007.08.003"},{"key":"6","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/S0021-9800(66)80027-3","article-title":"On a combinatorial conjecture of Erdo{combining double acute accent}s","volume":"1","author":"kleitman","year":"1966","journal-title":"J Combin Theory"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523342"},{"key":"4","first-page":"389","article-title":"Trace reconstruction with constant deletion probability and related results","author":"holenstein","year":"2008","journal-title":"Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"9","author":"konstantinova","year":"2007","journal-title":"Reconstruction of Permutations Distorted by Single Transposition Errors"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365486"}],"event":{"name":"2012 IEEE International Symposium on Information Theory - ISIT","location":"Cambridge, MA, USA","start":{"date-parts":[[2012,7,1]]},"end":{"date-parts":[[2012,7,6]]}},"container-title":["2012 IEEE International Symposium on Information Theory Proceedings"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6268627\/6281806\/06283016.pdf?arnumber=6283016","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T23:28:33Z","timestamp":1498001313000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6283016\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/isit.2012.6283016","relation":{},"subject":[],"published":{"date-parts":[[2012,7]]}}}