{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:51:44Z","timestamp":1743097904991,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662480533"},{"type":"electronic","value":"9783662480540"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48054-0_20","type":"book-chapter","created":{"date-parts":[[2015,8,10]],"date-time":"2015-08-10T11:57:29Z","timestamp":1439207849000},"page":"235-247","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Randomized Polynomial Time Protocol for Combinatorial Slepian-Wolf Problem"],"prefix":"10.1007","author":[{"given":"Daniyar","family":"Chumbalov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrei","family":"Romashchenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,11]]},"reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1109\/TIT.1973.1055037","volume":"19","author":"D Slepian","year":"1973","unstructured":"Slepian, D., Wolf, J.K.: Noiseless coding of correlated information sources. IEEE Trans. Inf. Theory 19, 471\u2013480 (1973)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"20_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/11538462_30","volume-title":"Approximation, Randomization and Combinatorial Optimization","author":"E Kaplan","year":"2005","unstructured":"Kaplan, E., Naor, M., Reingold, O.: Derandomized constructions of k-wise (almost) independent permutations. In: Chekuri, C., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) APPROX 2005 and RANDOM 2005. LNCS, vol. 3624, pp. 354\u2013365. Springer, Heidelberg (2005)"},{"key":"20_CR3","unstructured":"Smith, A.: Scrambling adversarial errors using few random bits, optimal information reconciliation, and better private codes. In: Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 395\u2013404 (2007)"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Guruswami, V., Smith, A.: Codes for computationally simple channels: explicit constructions with optimal rate. In: Proceedings of the 51st IEEE Symposium on Foundations of Computer Science (FOCS), pp. 723\u2013732 (2010)","DOI":"10.1109\/FOCS.2010.74"},{"key":"20_CR5","unstructured":"Chuklin, A.: Effective protocols for low-distance file synchronization (2011). arXiv:1102.4712"},{"key":"20_CR6","first-page":"656","volume":"10","author":"D Chumbalov","year":"2013","unstructured":"Chumbalov, D.: Combinatorial version of the Slepian-Wolf coding theorem for binary strings. Siberian Electron. Math. Rep. 10, 656\u2013665 (2013)","journal-title":"Siberian Electron. Math. Rep."},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1137\/0406043","volume":"6","author":"A Orlitsky","year":"1993","unstructured":"Orlitsky, A.: Interactive communication of balanced distributions and of correlated files. SIAM J. Discrete Math. 6, 548\u2013564 (1993)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"20_CR8","first-page":"1","volume":"1","author":"AN Kolmogorov","year":"1965","unstructured":"Kolmogorov, A.N.: Three approaches to the quantitative definition of information. Prob. Inf. Transm. 1(1), 1\u20137 (1965)","journal-title":"Prob. Inf. Transm."},{"issue":"3","key":"20_CR9","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1002\/j.1538-7305.1928.tb01236.x","volume":"7","author":"RVL Hartley","year":"1928","unstructured":"Hartley, R.V.L.: Transmission of information. Bell Syst. Tech. J. 7(3), 535\u2013563 (1928)","journal-title":"Bell Syst. Tech. J."},{"issue":"2","key":"20_CR10","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1006\/jcss.1999.1677","volume":"60","author":"D Hammer","year":"2000","unstructured":"Hammer, D., Romashchenko, A., Shen, A., Vereshchagin, N.: Inequalities for Shannon entropy and Kolmogorov complexity. J. Comput. Syst. Sci. 60(2), 442\u2013464 (2000)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1\u20132","key":"20_CR11","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/S0304-3975(01)00034-2","volume":"271","author":"A Romanshchenko","year":"2002","unstructured":"Romanshchenko, A., Shen, A., Vereshchagin, N.: Combinatorial interpretation of Kolmogorov complexity. Theoret. Comput. Sci. 271(1\u20132), 111\u2013123 (2002)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"20_CR12","first-page":"1","volume":"1","author":"TH Chan","year":"2001","unstructured":"Chan, T.H.: A combinatorial approach to information inequalities. Commun. Inf. Syst. 1(3), 1\u201314 (2001)","journal-title":"Commun. Inf. Syst."},{"issue":"1\u20132","key":"20_CR13","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/S0304-3975(01)00033-0","volume":"271","author":"A Muchnik","year":"2002","unstructured":"Muchnik, A.: Conditional complexity and codes. Theoret. Comput. Sci. 271(1\u20132), 97\u2013109 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"20_CR14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921889","volume-title":"Information Theory: Coding Theorems for Discrete Memoryless Systems","author":"I Csiszar","year":"2011","unstructured":"Csiszar, I., K\u00f6rner, J.: Information Theory: Coding Theorems for Discrete Memoryless Systems, 2nd edn. Cambridge University Press, Cambridge (2011)","edition":"2"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2015"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48054-0_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T14:29:01Z","timestamp":1676471341000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-48054-0_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662480533","9783662480540"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48054-0_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"11 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}