{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T01:06:49Z","timestamp":1755220009931,"version":"3.43.0"},"reference-count":21,"publisher":"IEEE","license":[{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1109\/isit.2018.8437750","type":"proceedings-article","created":{"date-parts":[[2018,8,17]],"date-time":"2018-08-17T16:14:55Z","timestamp":1534522495000},"page":"2351-2355","source":"Crossref","is-referenced-by-count":4,"title":["Optimal Achievable Rates for Computation With Random Homologous Codes"],"prefix":"10.1109","author":[{"given":"Pinar","family":"Sen","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of California, San Diego, USA"}]},{"given":"Sung Hoon","family":"Lim","sequence":"additional","affiliation":[{"name":"Korea Institute of Ocean Science and Technology, Busan, Korea"}]},{"given":"Young-Han","family":"Kim","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of California, San Diego, USA"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2518171"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006653"},{"journal-title":"IEEE Trans Inf Theory","article-title":"Homologous codes for multiple access channels","year":"2018","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620705"},{"key":"ref14","article-title":"A joint typicality approach to algebraic network information theory","volume":"abs 1606 9548","author":"lim","year":"2016","journal-title":"CoRR"},{"key":"ref15","first-page":"1818","article-title":"Towards an algebraic network information theory: Simultaneous joint typicality decoding","year":"2017","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2165816"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2013.130405"},{"journal-title":"Information Theory and Reliable Communication","year":"1968","author":"gallager","key":"ref18"},{"key":"ref19","article-title":"Optimal achievable rates for computation with random homologous codes","author":"sen","year":"2018","journal-title":"IEEE Trans Inf Theory"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056022"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1561\/0100000028","article-title":"Topics in multi-user information theory","volume":"4","author":"kramer","year":"2007","journal-title":"Foundations Trends Commun Inf Theory"},{"journal-title":"Coding theorems for point-to-point communication systems using sparse matrix codes","year":"2010","author":"miyake","key":"ref6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557577"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595486"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620605"},{"journal-title":"Elements of Information Theory","year":"2006","author":"cover","key":"ref2"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139030687"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283913"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2476792"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"}],"event":{"name":"2018 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2018,6,17]]},"location":"Vail, CO, USA","end":{"date-parts":[[2018,6,22]]}},"container-title":["2018 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8410646\/8437120\/08437750.pdf?arnumber=8437750","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,7]],"date-time":"2025-08-07T17:42:36Z","timestamp":1754588556000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8437750\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/isit.2018.8437750","relation":{},"subject":[],"published":{"date-parts":[[2018,6]]}}}