{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:26:52Z","timestamp":1740101212284,"version":"3.37.3"},"reference-count":17,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,11,1]]},"DOI":"10.1109\/itw54588.2022.9965762","type":"proceedings-article","created":{"date-parts":[[2022,12,7]],"date-time":"2022-12-07T20:47:00Z","timestamp":1670446020000},"page":"476-481","source":"Crossref","is-referenced-by-count":0,"title":["Signature Codes for a Noisy Adder Multiple Access Channel"],"prefix":"10.1109","author":[{"given":"Gokberk","family":"Erdogan","sequence":"first","affiliation":[{"name":"Technical University of Munich,Institute for Communications Engineering,Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Georg","family":"Maringer","sequence":"additional","affiliation":[{"name":"Technical University of Munich,Institute for Communications Engineering,Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikita","family":"Polyanskii","sequence":"additional","affiliation":[{"name":"IOTA Foundation,Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579188"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1134\/S0032946018010040"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2019.01.002"},{"article-title":"Signature codes for a noisy adder multiple access channel","year":"2022","author":"erdo?an","key":"ref13"},{"key":"ref14","first-page":"20","article-title":"Restricted occupancy theory-a generalization of pascal’s triangle","volume":"63","author":"freund","year":"1956","journal-title":"The American Mathematical Monthly"},{"key":"ref15","article-title":"Generalized Pascal Triangles and Pyramids: Their Fractals, Graphs, and Applications","author":"bondarenko","year":"1993","journal-title":"The Fibonacci Association"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1963.10500830"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1109\/TIT.1964.1053661","article-title":"Maximum distance q-nary codes","volume":"10","author":"singleton","year":"2006","journal-title":"IEEE Trans Inf Theor"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1966-007-2"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.4153\/CMB-1965-034-2"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056109"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32512-0_40"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-016-0228-1"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365146"},{"key":"ref2","first-page":"241","article-title":"On two problems of information theory","volume":"8","author":"erd?s","year":"1963","journal-title":"Publ Hung Acad Sci"},{"key":"ref1","first-page":"81","article-title":"Problem E 1399 in elementary problems and solutions","volume":"67","author":"shapiro","year":"1960","journal-title":"The American Mathematical Monthly"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1287\/moor.1030.0070","article-title":"On metric generators of graphs","volume":"29","author":"andr\u00e1s","year":"2004","journal-title":"Math Oper Res"}],"event":{"name":"2022 IEEE Information Theory Workshop (ITW)","start":{"date-parts":[[2022,11,1]]},"location":"Mumbai, India","end":{"date-parts":[[2022,11,9]]}},"container-title":["2022 IEEE Information Theory Workshop (ITW)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9965754\/9965755\/09965762.pdf?arnumber=9965762","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,26]],"date-time":"2022-12-26T19:42:08Z","timestamp":1672083728000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9965762\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,1]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/itw54588.2022.9965762","relation":{},"subject":[],"published":{"date-parts":[[2022,11,1]]}}}