{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T03:25:53Z","timestamp":1775013953290,"version":"3.50.1"},"reference-count":21,"publisher":"Pleiades Publishing Ltd","issue":"1","license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Probl Inf Transm"],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1134\/s0032946016010063","type":"journal-article","created":{"date-parts":[[2016,5,7]],"date-time":"2016-05-07T03:05:40Z","timestamp":1462590340000},"page":"66-91","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Interactive function computation via polar coding"],"prefix":"10.1134","volume":"52","author":[{"given":"T. C.","family":"G\u00fclc\u00fc","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. M.","family":"Barg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"137","published-online":{"date-parts":[[2016,5,8]]},"reference":[{"issue":"12","key":"4256_CR1","doi-asserted-by":"publisher","first-page":"6020","DOI":"10.1109\/TIT.2010.2080850","volume":"56","author":"O. Ayaso","year":"2010","unstructured":"Ayaso, O., Shah, D., and Daleh, M.A., Information Theoretic Bounds for Distributed Computation over Networks of Point-to-Point Channels, IEEE Trans. Inform. Theory, 2010, vol. 56, no. 12, pp. 6020\u20136039.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4256_CR2","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1145\/1993636.1993659","volume-title":"Proc. 43rd Annual ACM Sympos. on Theory of Computing (STOC\u20192011)","author":"M. Braverman","year":"2011","unstructured":"Braverman, M. and Rao, A., Towards Coding for Maximum Errors in Interactive Communication, in Proc. 43rd Annual ACM Sympos. on Theory of Computing (STOC\u20192011), San Jose, CA,USA, June 6\u20138, 2011, New York: ACM, 2011, pp. 159\u2013166."},{"key":"4256_CR3","doi-asserted-by":"crossref","unstructured":"Chen, H., Cramer, R., Goldwasser, S., de Haan, R., and Vaikuntanathan, V., Secure Computation from Random Error Correcting Codes, Advances in Cryptology (Proc. EUROCRYPT\u20192007: 26th Annual Int. Conf. on the Theory and Applications of Cryptographic Techniques, Barcelona, Spain, May 20\u201324, 2007), Naor, M., Ed., Lect. Notes Comp. Sci., vol. 4515, Berlin: Springer, 2007, pp. 291\u2013310.","DOI":"10.1007\/978-3-540-72540-4_17"},{"issue":"10","key":"4256_CR4","doi-asserted-by":"publisher","first-page":"3498","DOI":"10.1109\/TIT.2007.904785","volume":"53","author":"B. Nazar","year":"2007","unstructured":"Nazar, B. and Gastpar, M., Computation over Multiple-Access Channels, IEEE Trans. Inform. Theory, 2007, vol. 53, no. 10, pp. 3498\u20133516.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"10","key":"4256_CR5","doi-asserted-by":"publisher","first-page":"6337","DOI":"10.1109\/TIT.2011.2165807","volume":"57","author":"H. Tyagi","year":"2011","unstructured":"Tyagi, H., Narayan, P., and Gupta, P., When Is the Function Securely Computable?, IEEE Trans. Inform. Theory, 2011, vol. 57, no. 10, pp. 6337\u20136350.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"4256_CR6","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1109\/TIT.1979.1056022","volume":"25","author":"J. K\u00f6rner","year":"1979","unstructured":"K\u00f6rner, J. and Marton, K., How to Encode the Modulo-Two Sum of Binary Sources, IEEE Trans. Inform. Theory, 1979, vol. 25, no. 2, pp. 219\u2013221.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"4256_CR7","doi-asserted-by":"publisher","first-page":"903","DOI":"10.1109\/18.915643","volume":"47","author":"A. Orlitsky","year":"2001","unstructured":"Orlitsky, A. and Roche, J.R., Coding for Computing, IEEE Trans. Inform. Theory, 2001, vol. 47, no. 3, pp. 903\u2013917.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"9","key":"4256_CR8","doi-asserted-by":"publisher","first-page":"6180","DOI":"10.1109\/TIT.2011.2161916","volume":"57","author":"N. Ma","year":"2011","unstructured":"Ma, N. and Ishwar, P., Some Results on Distributed Source Coding for Interactive Function Computation, IEEE Trans. Inform. Theory, 2011, vol. 57, no. 9, pp. 6180\u20136195.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"7","key":"4256_CR9","doi-asserted-by":"publisher","first-page":"4289","DOI":"10.1109\/TIT.2012.2192094","volume":"58","author":"N. Ma","year":"2012","unstructured":"Ma, N., Ishwar, P., and Gupta, P., Interactive Source Coding for Function Computation in Collocated Networks, IEEE Trans. Inform. Theory, 2012, vol. 58, no. 7, pp. 4289\u20134305.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"7","key":"4256_CR10","doi-asserted-by":"publisher","first-page":"3051","DOI":"10.1109\/TIT.2009.2021379","volume":"55","author":"E. Arikan","year":"2009","unstructured":"Arikan, E., Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels, IEEE Trans. Inform. Theory, 2009, vol. 55, no. 7, pp. 3051\u20133073.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4256_CR11","doi-asserted-by":"publisher","first-page":"899","DOI":"10.1109\/ISIT.2010.5513567","volume-title":"Proc. 2010 IEEE Int. Sympos. on Information Theory (ISIT\u20192010)","author":"E. Arikan","year":"2010","unstructured":"Arikan, E., Source Polarization, in Proc. 2010 IEEE Int. Sympos. on Information Theory (ISIT\u20192010), Austin, TX,USA, June 13\u201318, 2010, pp. 899\u2013903."},{"key":"4256_CR12","volume-title":"Polar Codes for Channel and Source Coding","author":"S.B. Korada","year":"2009","unstructured":"Korada, S.B., Polar Codes for Channel and Source Coding, PhD Thesis, \u00e9cole polytechnique f\u00e9d\u00e9rale de Lausanne, Lausanne, Switzerland, 2009."},{"issue":"4","key":"4256_CR13","doi-asserted-by":"publisher","first-page":"1751","DOI":"10.1109\/TIT.2010.2040961","volume":"56","author":"S. Korada","year":"2010","unstructured":"Korada, S. and Urbanke, R., Polar Codes are Optimal for Lossy Source Coding, IEEE Trans. Inform. Theory, 2010, vol. 56, no. 4, pp. 1751\u20131768.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"12","key":"4256_CR14","doi-asserted-by":"publisher","first-page":"7829","DOI":"10.1109\/TIT.2013.2282305","volume":"59","author":"J. Honda","year":"2013","unstructured":"Honda, J. and Yamamoto, H., Polar Coding without Alphabet Extension for Asymmetric Models, IEEE Trans. Inform. Theory, 2013, vol. 59, no. 12, pp. 7829\u20137838.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4256_CR15","doi-asserted-by":"publisher","first-page":"1493","DOI":"10.1109\/ISIT.2009.5205856","volume-title":"Proc. 2009 IEEE Int. Sympos. on Information Theory (ISIT\u20192009)","author":"E. Arikan","year":"2009","unstructured":"Arikan, E. and Telatar, I.E., On the Rate of Channel Polarization, in Proc. 2009 IEEE Int. Sympos. on Information Theory (ISIT\u20192009), Seoul, Korea, June 28\u2013July 3, 2009, pp. 1493\u20131495."},{"key":"4256_CR16","first-page":"789","volume-title":"Proc. 52nd Annual Allerton Conf. on Communication, Control, and Computing","author":"M. Mondelli","year":"2014","unstructured":"Mondelli, M., Hassani, H., and Urbanke, R., How to Achieve the Capacity of Asymmetric Channels, in Proc. 52nd Annual Allerton Conf. on Communication, Control, and Computing, Monticello, IL,USA, Oct. 1\u20133, 2014, pp. 789\u2013796."},{"key":"4256_CR17","volume-title":"Elements of Information Theory","author":"T.M. Cover","year":"2006","unstructured":"Cover, T.M. and Thomas, J.A., Elements of Information Theory, Hoboken, NJ: Wiley, 2006, 2nd ed."},{"key":"4256_CR18","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1109\/ITW.2009.5351487","volume-title":"Proc. IEEE 2009 Information Theory Workshop (ITW\u20192009)","author":"E. \u0160a\u0161oglu","year":"2009","unstructured":"\u0160a\u0161oglu, E., Telatar, I.E., and Arikan, E., Polarization for Arbitrary Discrete Memoryless Channels, in Proc. IEEE 2009 Information Theory Workshop (ITW\u20192009), Taormina, Sicily (Italy), Oct. 11\u201316, 2009, pp. 144\u2013148."},{"issue":"2","key":"4256_CR19","doi-asserted-by":"publisher","first-page":"955","DOI":"10.1109\/TIT.2012.2219035","volume":"59","author":"W. Park","year":"2013","unstructured":"Park, W. and Barg, A., Polar Codes for q-ary Channels, q = 2r, IEEE Trans. Inform. Theory, 2013, vol. 59, no. 2, pp. 955\u2013969.","journal-title":"q = 2r, IEEE Trans. Inform. Theory"},{"issue":"10","key":"4256_CR20","doi-asserted-by":"publisher","first-page":"6562","DOI":"10.1109\/TIT.2013.2272694","volume":"59","author":"I. Tal","year":"2013","unstructured":"Tal, I. and Vardy, A., How to Construct Polar Codes, IEEE Trans. Inform. Theory, 2013, vol. 59, no. 10, pp. 6562\u20136582.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"7","key":"4256_CR21","doi-asserted-by":"publisher","first-page":"4071","DOI":"10.1109\/TIT.2013.2251412","volume":"59","author":"N. Ma","year":"2013","unstructured":"Ma, N. and Ishwar, P., The Infinite-Message Limit of Two-Terminal Interactive Source Coding, IEEE Trans. Inform. Theory, 2013, vol. 59, no. 7, pp. 4071\u20134094.","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Problems of Information Transmission"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946016010063.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0032946016010063","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946016010063","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946016010063.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:14:27Z","timestamp":1775009667000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0032946016010063"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["4256"],"URL":"https:\/\/doi.org\/10.1134\/s0032946016010063","relation":{},"ISSN":["0032-9460","1608-3253"],"issn-type":[{"value":"0032-9460","type":"print"},{"value":"1608-3253","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,1]]},"assertion":[{"value":"17 February 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 July 2015","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 May 2016","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}