{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T05:00:21Z","timestamp":1773378021372,"version":"3.50.1"},"reference-count":14,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"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":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849304","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"425-429","source":"Crossref","is-referenced-by-count":2,"title":["Multi-User UD k-Ary Codes Recursively Constructed from Short-Length Multiary Codes for Multiple-Access Adder Channel"],"prefix":"10.1109","author":[{"given":"Shan","family":"Lu","sequence":"first","affiliation":[{"name":"Department of Electrical, Electronic, and Computer Engineering, Gifu University, Gifu, 501-1193, Japan"}]},{"given":"Wei","family":"Hou","sequence":"additional","affiliation":[{"name":"The State Key Laboratory of ISN, Xidian University, Xi’an, 710071, China"}]},{"given":"Jun","family":"Cheng","sequence":"additional","affiliation":[{"name":"Department of Intelligent Information Engineering and Sciences, Doshisha University, Kyoto, 610-0321, Japan"}]},{"given":"Hiroshi","family":"Kamabe","sequence":"additional","affiliation":[{"name":"Department of Electrical, Electronic, and Computer Engineering, Gifu University, Gifu, 501-1193, Japan"}]}],"member":"263","reference":[{"key":"ref10","first-page":"1914","article-title":"T-user uniquely decodable k-ary affine code for multiple-access adder channel","volume":"e83 a","author":"cheng","year":"2000","journal-title":"IEICE Trans Fundamentals"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/18.945276"},{"key":"ref12","author":"macwilliams","year":"1977","journal-title":"The Theory of Error-Correcting Codes"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2018.8613495"},{"key":"ref14","first-page":"536","article-title":"Coding scheme for T-user noisy multiple-access adder channel","author":"lu","year":"2014","journal-title":"Proc of 2014 International Symposium on Information Theory and its Applications (ISITA)"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.485711"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056109"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480194265623"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.705572"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/18.9792"},{"key":"ref7","first-page":"2011","article-title":"T-user code with arbitrary code length for multiple-access adder channel","volume":"e82 a","author":"cheng","year":"1999","journal-title":"IEICE Trans Fundamentals"},{"key":"ref2","first-page":"334","article-title":"Construction of signature codes and the coin weighing problem","volume":"25","author":"martirosyan","year":"1989","journal-title":"Problems of Information Transmission"},{"key":"ref1","article-title":"Determining subsets by unramified experiments","author":"lindstr\u00f6m","year":"1975","journal-title":"A Survey of Statistical Design and Linear Models"},{"key":"ref9","first-page":"541","article-title":"Affine code for T-user noisy multiple-access adder channel","volume":"e83 a","author":"cheng","year":"2000","journal-title":"IEICE Trans Fundamentals"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849304.pdf?arnumber=8849304","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:56Z","timestamp":1773347756000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849304\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849304","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}