{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:54:10Z","timestamp":1740131650642,"version":"3.37.3"},"reference-count":24,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T00:00:00Z","timestamp":1535760000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["RaCAF ANR-15-CE40-0016-01"],"award-info":[{"award-number":["RaCAF ANR-15-CE40-0016-01"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1109\/tit.2018.2854589","type":"journal-article","created":{"date-parts":[[2018,7,9]],"date-time":"2018-07-09T18:28:21Z","timestamp":1531160901000},"page":"6054-6069","source":"Crossref","is-referenced-by-count":1,"title":["On the Combinatorial Version of the Slepian\u2013Wolf Problem"],"prefix":"10.1109","volume":"64","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9825-3521","authenticated-orcid":false,"given":"Daniyar","family":"Chumbalov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7723-7880","authenticated-orcid":false,"given":"Andrei","family":"Romashchenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1677"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.4310\/CIS.2001.v1.n3.a1"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/18.959290"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00033-0"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00034-2"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.813496"},{"journal-title":"List decoding of error-correcting codes","year":"2004","author":"guruswami","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24638-1_25"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/11538462_30"},{"key":"ref19","first-page":"395","article-title":"Scrambling adversarial errors using few random bits, optimal information reconciliation, and better private codes","author":"smith","year":"2007","journal-title":"Proc of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA)"},{"key":"ref4","first-page":"41","article-title":"New upper bounds for error correcting codes","volume":"1","author":"bassalygo","year":"1965","journal-title":"Problems Inf Transmiss"},{"key":"ref3","first-page":"1","article-title":"Three approaches to the quantitative definition of information","volume":"1","author":"kolmogorov","year":"1965","journal-title":"Problems Inf Transmiss"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055171"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055037"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(79)90044-8"},{"journal-title":"The Theory of Error-Correcting Codes","year":"1977","author":"macwilliams","key":"ref7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057714"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1928.tb01236.x"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/S089548019223872X"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.74"},{"journal-title":"Effective protocols for low-distance file synchronization","year":"2011","author":"chuklin","key":"ref22"},{"journal-title":"Introduction to Coding Theory (CMU Spr 2010) Notes 4 Elementary Bounds on Codes","year":"2010","author":"guruswami","key":"ref21"},{"key":"ref24","first-page":"656","article-title":"Combinatorial version of the slepian-wolf coding theorem for binary strings","volume":"10","author":"chumbalov","year":"2013","journal-title":"Siberian Electron Math Rep"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921889"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8438569\/08408819.pdf?arnumber=8408819","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:16:08Z","timestamp":1642004168000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8408819\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9]]},"references-count":24,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tit.2018.2854589","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2018,9]]}}}