{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T16:30:06Z","timestamp":1754152206932,"version":"3.41.2"},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[1983,1,1]],"date-time":"1983-01-01T00:00:00Z","timestamp":410227200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[1983,1,1]],"date-time":"1983-01-01T00:00:00Z","timestamp":410227200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[1983,1,1]],"date-time":"1983-01-01T00:00:00Z","timestamp":410227200000},"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":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[1983,1]]},"DOI":"10.1109\/tit.1983.1056614","type":"journal-article","created":{"date-parts":[[2004,4,27]],"date-time":"2004-04-27T14:27:04Z","timestamp":1083076024000},"page":"114-130","source":"Crossref","is-referenced-by-count":34,"title":["Graph theoretic approaches to the code construction for the two-user multiple- access binary adder channel"],"prefix":"10.1109","volume":"29","author":[{"given":"T.","family":"Kasami","sequence":"first","affiliation":[]},{"family":"Shu Lin","sequence":"additional","affiliation":[]},{"given":"V.","family":"Wei","sequence":"additional","affiliation":[]},{"given":"S.","family":"Yamamura","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref21a","first-page":"436","article-title":"Egy Gr\ufffdfelmeleti Sz\ufffdlso\ufffdrtekf\ufffdladatrol","volume":"48","author":"tu?n","year":"1941","journal-title":"Mat \ufffds Fizikai Lopok"},{"key":"ref21b","first-page":"19","article-title":"On the theory of graphs","volume":"33","year":"1954","journal-title":"Colloq Math"},{"key":"ref21c","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70969-5"},{"journal-title":"Transmission of Information","year":"1961","author":"fano","key":"ref30"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055814"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055860"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(78)90312-1"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055932"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056000"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056301"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056109"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1147\/rd.244.0486"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055933"},{"key":"ref19","article-title":"Some simple codes for the asynchronized multiple-access adder channel","author":"lin","year":"0","journal-title":"1979 IEEE Int Symp Information Theory"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055688"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055312"},{"journal-title":"Error-Correcting Codes","year":"1961","author":"peterson","key":"ref27"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1973.tb02004.x"},{"key":"ref6","first-page":"18","article-title":"Boundary of region of permissible rates for asynchronous communication over a binary summing channel","volume":"15","author":"grigor'ev","year":"1979","journal-title":"Prob Inform Transmission"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1958-023-9"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055652"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056304"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056382"},{"key":"ref2","first-page":"23","article-title":"Multi-way communication channels","author":"alswede","year":"1973","journal-title":"Proc 2nd Int Symp Inform Theory"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055529"},{"journal-title":"Multiple access channels","year":"1972","author":"liao","key":"ref1"},{"key":"ref20","article-title":"Lower bounds on the achievable rates of synchronizable and uniquely decodable two-user codes for the nonsynchronized multiple-access adder channel","author":"kasami","year":"1979","journal-title":"Proc Second Conf Inform Theory and Its Applications"},{"journal-title":"Graphs and Hypergraphs","year":"1976","author":"berge","key":"ref22"},{"journal-title":"Error-Correcting Codes","year":"1971","author":"peterson","key":"ref24"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/800125.804034"},{"journal-title":"Sequential Decoding","year":"1961","author":"wozencraft","key":"ref26"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-64971-4"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/22730\/01056614.pdf?arnumber=1056614","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,21]],"date-time":"2025-07-21T18:07:30Z","timestamp":1753121250000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1056614\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,1]]},"references-count":32,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tit.1983.1056614","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[1983,1]]}}}