{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T06:42:16Z","timestamp":1648968136703},"reference-count":17,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2016,5,1]],"date-time":"2016-05-01T00:00:00Z","timestamp":1462060800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1109\/tit.2016.2535172","type":"journal-article","created":{"date-parts":[[2016,2,26]],"date-time":"2016-02-26T19:19:40Z","timestamp":1456514380000},"page":"2737-2747","source":"Crossref","is-referenced-by-count":2,"title":["Compression for Quadratic Similarity Queries: Finite Blocklength and Practical Schemes"],"prefix":"10.1109","volume":"62","author":[{"given":"Fabian","family":"Steiner","sequence":"first","affiliation":[]},{"given":"Steffen","family":"Dempfle","sequence":"additional","affiliation":[]},{"given":"Amir","family":"Ingber","sequence":"additional","affiliation":[]},{"given":"Tsachy","family":"Weissman","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056351"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-005-1202-2"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2249-9"},{"key":"ref13","author":"miller","year":"1964","journal-title":"Multidimensional Gaussian Distributions"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056489"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1960.1057548"},{"key":"ref16","article-title":"Design and analysis of spherical codes","author":"hamkins","year":"1996"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.804056"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-3626-0"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875352"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.641545"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-007-9000-7"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.3923\/ajms.2011.66.70"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref2","article-title":"The minimal compression rate for similarity identification","author":"ingber","year":"2013"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2402972"},{"key":"ref9","author":"olver","year":"2010","journal-title":"NIST Handbook of Mathematical Functions"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/7456355\/7420688.pdf?arnumber=7420688","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:42:23Z","timestamp":1642005743000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7420688\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5]]},"references-count":17,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tit.2016.2535172","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,5]]}}}