{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T21:01:04Z","timestamp":1774990864548,"version":"3.50.1"},"reference-count":19,"publisher":"IEEE","license":[{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"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":[[2016,7]]},"DOI":"10.1109\/isit.2016.7541316","type":"proceedings-article","created":{"date-parts":[[2016,8,15]],"date-time":"2016-08-15T18:52:57Z","timestamp":1471287177000},"page":"335-339","source":"Crossref","is-referenced-by-count":3,"title":["Sharper upper bounds for unbalanced Uniquely Decodable Code Pairs"],"prefix":"10.1109","author":[{"given":"Per","family":"Austrin","sequence":"first","affiliation":[{"name":"School of Computer Science and Communication, KTH Royal Institute of Technology, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petteri","family":"Kaski","sequence":"additional","affiliation":[{"name":"Helsinki Institute for Information Technology HIIT, Department of Computer Science, Aalto University, Finland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikko","family":"Koivisto","sequence":"additional","affiliation":[{"name":"Helsinki Institute for Information Technology HIIT, Department of Computer Science, University of Helsinki, Finland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jesper","family":"Nederlof","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Computer Science, Technical University of Eindhoven, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Multiple access channels","author":"liao","year":"1972"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/0022-314X(72)90052-2"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.853309"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/BF02773611"},{"key":"ref14","article-title":"An upper bound on the sizes of multiset-union-free families","author":"ordentlich","year":"2014","journal-title":"CoRR arXiv 1412 8415"},{"key":"ref15","author":"sleger","year":"2006","journal-title":"Coordinated Multiuser Communications"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.1998.706434"},{"key":"ref17","first-page":"83","article-title":"Constructions and an existence result of uniquely decodable codepairs for the two-access binary adder channel","author":"van den braak","year":"1984","journal-title":"Department of Mathematica and Computing Science Michigan State University Eindhoven University of Technology Tech Rep"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057004"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055814"},{"key":"ref4","first-page":"48","article-title":"Subset sum in the absence of concentration","author":"austrin","year":"2015","journal-title":"32nd International Symposium on Theoretical Aspects of Computer Science STACS 2015"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541316"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.2000.3127"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056109"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055529"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.485711"},{"key":"ref2","first-page":"23","article-title":"Multi-way communication channels","author":"ahlswede","year":"1973","journal-title":"Second InternationalSymposium on Information Theory ISIT 1971"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.746834"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056614"}],"event":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","location":"Barcelona, Spain","start":{"date-parts":[[2016,7,10]]},"end":{"date-parts":[[2016,7,15]]}},"container-title":["2016 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7532279\/7541040\/07541316.pdf?arnumber=7541316","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T19:52:03Z","timestamp":1774986723000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7541316\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/isit.2016.7541316","relation":{},"subject":[],"published":{"date-parts":[[2016,7]]}}}