{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T05:24:25Z","timestamp":1761110665087,"version":"build-2065373602"},"reference-count":19,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2022,12,29]],"date-time":"2022-12-29T00:00:00Z","timestamp":1672272000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["1900911"],"award-info":[{"award-number":["1900911"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>This paper considers the Strongly Asynchronous, Slotted, Discrete Memoryless, Massive Access Channel (SAS-DM-MAC) in which the number of users, the number of messages, and the asynchronous window length grow exponentially with the coding blocklength with their respective exponents. A joint probability of error is enforced, ensuring that all the users\u2019 identities and messages are correctly identified and decoded. Achievability bounds are derived for the case that different users have similar channels, the case that users\u2019 channels can be chosen from a set which has polynomially many elements in the blocklength, and the case with no restriction on the users\u2019 channels. A general converse bound on the capacity region and a converse bound on the maximum growth rate of the number of users are derived. It is shown that reliable transmission with an exponential number of users with an exponential asynchronous exponent with joint error probability is possible at strictly positive rates.<\/jats:p>","DOI":"10.3390\/e25010065","type":"journal-article","created":{"date-parts":[[2022,12,30]],"date-time":"2022-12-30T03:31:17Z","timestamp":1672371077000},"page":"65","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["The Strongly Asynchronous Massive Access Channel"],"prefix":"10.3390","volume":"25","author":[{"given":"Sara","family":"Shahi","sequence":"first","affiliation":[{"name":"Electrical and Computer Engineering Department, University of Illinois at Chicago, Chicago, IL 60607, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniela","family":"Tuninetti","sequence":"additional","affiliation":[{"name":"Electrical and Computer Engineering Department, University of Illinois at Chicago, Chicago, IL 60607, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1619-4095","authenticated-orcid":false,"given":"Natasha","family":"Devroye","sequence":"additional","affiliation":[{"name":"Electrical and Computer Engineering Department, University of Illinois at Chicago, Chicago, IL 60607, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2022,12,29]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"3725","DOI":"10.1109\/TIT.2008.926444","article-title":"Optimal Sequential Frame Synchronization","volume":"54","author":"Chandar","year":"2008","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"1227","DOI":"10.1109\/TIT.2012.2227238","article-title":"Asynchronous Communication: Capacity Bounds and Suboptimality of Training","volume":"59","author":"Tchamkerten","year":"2013","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"7686","DOI":"10.1109\/TIT.2014.2360017","article-title":"Energy and Sampling Constrained Asynchronous Communication","volume":"60","author":"Tchamkerten","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"3516","DOI":"10.1109\/TIT.2017.2668391","article-title":"Capacity of Gaussian many-access channels","volume":"63","author":"Chen","year":"2017","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Polyanskiy, Y. (2017, January 25\u201330). A perspective on massive random-access. Proceedings of the IEEE International Symposium on Information Theory (ISIT), Aachen, Germany.","DOI":"10.1109\/ISIT.2017.8006984"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1109\/18.42172","article-title":"Identification via channels","volume":"35","author":"Ahlswede","year":"1989","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_7","unstructured":"Han, T.S., and Verdu, S. (1991, January 24\u201328). Identification Plus Transmission. Proceedings of the 1991 IEEE International Symposium on Information Theory, Budapest, Hungary."},{"key":"ref_8","unstructured":"Kiefer, J., and Sobel, M. (1968). Sequential Identification and Ranking Procedures, with Special Reference to Koopman-Darmois Populations, University of Chicago Press."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Ahlswede, R., and Haroutunian, E. (2006). On logarithmically asymptotically optimal testing of hypotheses and identification. General Theory of Information Transfer and Combinatorics, Springer.","DOI":"10.1007\/11889342_33"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1109\/TIT.2014.2374157","article-title":"Asymptotically optimal matching of multiple sequences to source distributions and training sequences","volume":"61","author":"Unnikrishnan","year":"2015","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Shahi, S., Tuninetti, D., and Devroye, N. (2016, January 10\u201315). On the capacity of strong asynchronous multiple access channels with a large number of users. Proceedings of the IEEE International Symposium on Information Theory (ISIT), Barcelona, Spain.","DOI":"10.1109\/ISIT.2016.7541546"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Shahi, S., Tuninetti, D., and Devroye, N. (2017, January 6\u201310). On the capacity of the slotted strongly asynchronous channel with a bursty user. Proceedings of the 2017 IEEE Information Theory Workshop (ITW), Kaohsiung, Taiwan.","DOI":"10.1109\/ITW.2017.8277980"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Shahi, S., Tuninetti, D., and Devroye, N. (2018, January 17\u201322). On Identifying a Massive Number of Distributions. Proceedings of the IEEE International Symposium on Information Theory (ISIT), Vail, CO, USA.","DOI":"10.1109\/ISIT.2018.8437586"},{"key":"ref_14","unstructured":"Gallager, R.G. (1968). Information Theory and Reliable Communication, Springer."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"1256","DOI":"10.1109\/TIT.2012.2230682","article-title":"Asynchronous Communication: Exact Synchronization, Universality, and Dispersion","volume":"59","author":"Polyanskiy","year":"2013","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_16","unstructured":"Chandar, V., and Tchamkerten, A. (2022, August 29). A Note on Bursty MAC. Available online: https:\/\/www.google.com\/url?sa=t&rct=j&q=&esrc=s&source=web&cd=&ved=2ahUKEwiL8qDGgZ78AhXgmVYBHcCSAtoQFnoECA4QAQ&url=https%3A%2F%2Fperso.telecom-paristech.fr%2Ftchamker%2Fburstymac.pdf&usg=AOvVaw0ferJC5-OOrr-KzrA7XG1V."},{"key":"ref_17","unstructured":"Cover, T.M., and Thomas, J.A. (2012). Elements of Information Theory, John Wiley & Sons."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1090\/S0002-9947-1952-0045327-5","article-title":"On the application of the Borel-Cantelli lemma","volume":"72","author":"Chung","year":"1952","journal-title":"Trans. Am. Math. Soc."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Csisz\u00e1r, I., and K\u00f6rner, J. (2011). Information Theory: Coding Theorems for Discrete Memoryless Systems, Cambridge University Press.","DOI":"10.1017\/CBO9780511921889"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/25\/1\/65\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T01:55:48Z","timestamp":1760147748000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/25\/1\/65"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,29]]},"references-count":19,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2023,1]]}},"alternative-id":["e25010065"],"URL":"https:\/\/doi.org\/10.3390\/e25010065","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2022,12,29]]}}}