{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T18:12:06Z","timestamp":1771611126679,"version":"3.50.1"},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2015,5,1]],"date-time":"2015-05-01T00:00:00Z","timestamp":1430438400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"NSF Center for Science of Information","award":["CCF-0939370"],"award-info":[{"award-number":["CCF-0939370"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2015,5]]},"DOI":"10.1109\/tit.2015.2402972","type":"journal-article","created":{"date-parts":[[2015,2,11]],"date-time":"2015-02-11T20:03:47Z","timestamp":1423685027000},"page":"2729-2747","source":"Crossref","is-referenced-by-count":12,"title":["Compression for Quadratic Similarity Queries"],"prefix":"10.1109","volume":"61","author":[{"given":"Amir","family":"Ingber","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Courtade","sequence":"additional","affiliation":[]},{"given":"Tsachy","family":"Weissman","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref31","article-title":"Compression for quadratic similarity queries: Finite blocklength and practical schemes","author":"steiner","year":"2014"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139030687"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/978-3-642-03351-3_25","article-title":"An optimal Bloom filter replacement based on matrix solving","volume":"5675","author":"porat","year":"2009","journal-title":"Computer Science–Theory and Applications"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2004.10129096"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327494"},{"key":"ref13","first-page":"189","article-title":"Extensions of Lipschitz mappings into a Hilbert space","volume":"26","author":"johnson","year":"1984","journal-title":"Proc Conf Modern Anal Probab"},{"key":"ref14","author":"indyk","year":"2007","journal-title":"Sketching streaming and sublinear-space algorithms"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2013.33"},{"key":"ref16","author":"gallager","year":"1968","journal-title":"Information Theory and Reliable Communication"},{"key":"ref17","author":"cover","year":"2006","journal-title":"Elements of Information Theory"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055204"},{"key":"ref19","first-page":"1891","article-title":"Error exponent for coding of memoryless Gaussian sources with a fidelity criterion","volume":"83 a","author":"ihara","year":"2000","journal-title":"IEICE Trans Fundam Electron Commun Comput Sci"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/18.669158"},{"key":"ref4","first-page":"1","article-title":"Large deviations performance analysis for biometrics recognition","author":"o\u2019sullivan","year":"2002","journal-title":"Proc Allerton Conf Commun Control Comput"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921889"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055508"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.911296"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-3626-0"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2003.1228096"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2290302"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2016057"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.828068"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.567648"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1093\/ietfec\/e88-a.5.1339"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-5320-4"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/BSC.2006.1644580"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-55566-4_10"},{"key":"ref23","article-title":"The minimal compression rate for similarity identification","author":"ingber","year":"2013"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-007-9000-7"},{"key":"ref25","author":"ledoux","year":"2011","journal-title":"Probability in Banach spaces Isoperimetry and Processes"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/7088688\/07039228.pdf?arnumber=7039228","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:51:22Z","timestamp":1642006282000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7039228\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5]]},"references-count":31,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tit.2015.2402972","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,5]]}}}