{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:37:37Z","timestamp":1773376657137,"version":"3.50.1"},"reference-count":39,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"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":[[2023,6,25]]},"DOI":"10.1109\/isit54713.2023.10206781","type":"proceedings-article","created":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T13:31:15Z","timestamp":1692711075000},"page":"933-938","source":"Crossref","is-referenced-by-count":3,"title":["Permutation Sum-Capacity of Binary Adder Multiple-Access Channels"],"prefix":"10.1109","author":[{"given":"William","family":"Lu","sequence":"first","affiliation":[{"name":"Purdue University,Department of Computer Science,West Lafayette,IN,47907"}]},{"given":"Anuran","family":"Makur","sequence":"additional","affiliation":[{"name":"Purdue University,School of Electrical and Computer Engineering,West Lafayette,IN,47907"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2018.8636070"},{"key":"ref2","article-title":"Information contraction and decomposition","volume-title":"Sc.D. Thesis in Electrical Engineering and Computer Science","author":"Makur","year":"2019"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174455"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3009468"},{"key":"ref5","doi-asserted-by":"crossref","DOI":"10.1109\/ISIT50566.2022.9834509","article-title":"Capacity of noisy permutation channels","author":"Tang","year":"2022"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2789292"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3058966"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3120920"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3091762"},{"key":"ref10","first-page":"573","article-title":"On transmission over deletion channels","volume-title":"Proceedings of the 39th Annual Allerton Conference on Communication, Control, and Computing","author":"Diggavi"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2018226"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.885443"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595073"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2032851"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2013.022713.122397"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-013-9893-5"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TMBMC.2016.2537305"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1126\/science.aaj2038"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007106"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849789"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2555321"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2018.2868666"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056109"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139030687"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055529"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2004.1405307"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056301"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.262047"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/s0019-9958(78)90312-1"},{"key":"ref30","volume-title":"Computer Networking: A Top-Down Approach","author":"Kurose","year":"2016"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/VTCSpring.2013.6692652"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2024.3350436"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2015.7447036"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9780511810817"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1201\/9781003072584-9"},{"key":"ref36","volume-title":"Matrix Perturbation Theory","author":"Stewart","year":"1990"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1080\/00927870902971320"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-93839-4"}],"event":{"name":"2023 IEEE International Symposium on Information Theory (ISIT)","location":"Taipei, Taiwan","start":{"date-parts":[[2023,6,25]]},"end":{"date-parts":[[2023,6,30]]}},"container-title":["2023 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206429\/10206441\/10206781.pdf?arnumber=10206781","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:27:23Z","timestamp":1773347243000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10206781\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,25]]},"references-count":39,"URL":"https:\/\/doi.org\/10.1109\/isit54713.2023.10206781","relation":{},"subject":[],"published":{"date-parts":[[2023,6,25]]}}}