{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,29]],"date-time":"2026-03-29T15:42:38Z","timestamp":1774798958946,"version":"3.50.1"},"reference-count":64,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[1985,3,1]],"date-time":"1985-03-01T00:00:00Z","timestamp":478483200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[1985,3,1]],"date-time":"1985-03-01T00:00:00Z","timestamp":478483200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[1985,3,1]],"date-time":"1985-03-01T00:00:00Z","timestamp":478483200000},"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":[[1985,3]]},"DOI":"10.1109\/tit.1985.1057022","type":"journal-article","created":{"date-parts":[[2004,4,27]],"date-time":"2004-04-27T14:27:04Z","timestamp":1083076024000},"page":"124-142","source":"Crossref","is-referenced-by-count":490,"title":["A perspective on multiaccess channels"],"prefix":"10.1109","volume":"31","author":[{"given":"R.","family":"Gallager","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref54a","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.1980.271872"},{"key":"ref39","article-title":"Delay analysis of the modified 0.487 contention resolution algorithm","author":"huang","year":"0","journal-title":"IEEE Trans Inform Theory"},{"key":"ref38","first-page":"76","article-title":"An upper bound on packet delay in a multiple access channel","volume":"18","author":"tsybakov","year":"1980","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref54b","year":"0"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1980.1094785"},{"key":"ref30","first-page":"5.20","article-title":"A Study of unslotted Aloha with arbitrary message lengths","author":"ferguson","year":"1975","journal-title":"?roc 4th Data Communications Symp"},{"key":"ref37","first-page":"65","article-title":"Random multiple access of packets: Part and try algorithm","volume":"16","author":"tsybakov","year":"1980","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref36","first-page":"74","article-title":"Conflict resolution in random access broadcast networks","author":"gallager","year":"1978","journal-title":"? roc AFOSR Workshop Communication Theory and Applications"},{"key":"ref34","first-page":"32","article-title":"Free synchronous packet access in a broadcast channel with feedback","volume":"14","author":"tsybakov","year":"1978","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056059"},{"key":"ref27","author":"roberts","year":"1972","journal-title":"Aloha packet system with and without slots and capture"},{"key":"ref33a","author":"hayes","year":"1976","journal-title":"An adaptive technique for local distribution"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1982.1102978"},{"key":"ref33b","first-page":"1178","volume":"com 26","year":"1978","journal-title":"IEEE Trans Commun"},{"key":"ref2","first-page":"23","article-title":"Multi-way communication channels","author":"ahlswede","year":"1971","journal-title":"Proc 2nd Int Symp Information Theory"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1478462.1478502"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057012"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1968.1089837"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1971.1090714"},{"key":"ref24","author":"arikan","year":"0","journal-title":"private communication"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056383"},{"key":"ref26","author":"humblet","year":"1983","journal-title":"Error exponents for a direct detection optical channel"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1981.1094916"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1984.1096146"},{"key":"ref32b","year":"1977","journal-title":"Abstracts IEEE Int Symp Inform Theory"},{"key":"ref32c","first-page":"505","volume":"it 25","year":"1979","journal-title":"IEEE Trans Inform Theory"},{"key":"ref3b","year":"0"},{"key":"ref3a","article-title":"A coding theorem for multiple access communications","author":"liao","year":"1972","journal-title":"Proc Int Symp Information Theory"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.1984.1146083"},{"key":"ref55","first-page":"12","article-title":"Coding in an asynchronous multiple-access channel","author":"poltyrev","year":"1983","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref32a","author":"capetanakis","year":"1977","journal-title":"The multiple access broadcast channel Protocol and capacity considerations"},{"key":"ref53","author":"massey","year":"1980","journal-title":"Collision resolution algorithms and random-access communications"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1975.1092768"},{"key":"ref10","author":"gallager","year":"1968","journal-title":"Information Theory and Reliable Communication"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056064"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054753"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054855"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057010"},{"key":"ref15","first-page":"23","article-title":"Lower bound for the error probability of multiple-access channels","volume":"11","author":"arutyunyan","year":"1975","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1980.1056274"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055312"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1984.1056935"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056382"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1980.11897"},{"key":"ref50a","article-title":"Multiaccess of a slotted channel by finitely many users","author":"hluchyj","year":"1981","journal-title":"Proc National Telecommunications Conf"},{"key":"ref6","author":"csiszar","year":"1981","journal-title":"Information Theory Coding Theorems for Discrete Memoryless Systems"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055652"},{"key":"ref8","author":"pursley","year":"1984","journal-title":"Frequency-hop transmission for satellite packet switching and terrestrial packet radio networks"},{"key":"ref35a","author":"massey","year":"1977","journal-title":"private communication"},{"key":"ref50b","year":"1981"},{"key":"ref49","article-title":"Q-ary collision resolution algorithms in random-access systems with free or blocked channel access","author":"mathys","year":"0","journal-title":"IEEE Trans Inform Theory"},{"key":"ref7","article-title":"Special Issue on Spread Spectrum","year":"1982","journal-title":"IEEE Trans Commun"},{"key":"ref35b","year":"1980","journal-title":"Collision resolution algorithms and random-access communications"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1973.tb02004.x"},{"key":"ref46","first-page":"90","article-title":"Upper bound for the capacity of a random multiple access system","volume":"17","author":"mikhailov","year":"1981","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056510"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057023"},{"key":"ref47","author":"cruz","year":"1982","journal-title":"Protocols for multiaccess channels with continuous entry and noisy feedback"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056332"},{"key":"ref41","first-page":"141","article-title":"Non-optimality of the part-and-try algorithm","author":"vvedenskaya","year":"1983","journal-title":"Int Workshop on Convolutional Codes and Multiuser Communication"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056509"},{"key":"ref40b","year":"1982","journal-title":"Laboratory for Information and Decision Systems"},{"key":"ref40a","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1985.1096261"},{"key":"ref43","doi-asserted-by":"crossref","DOI":"10.21236\/ADA086655","author":"humblet","year":"1980","journal-title":"Bounds on the utilization of ALOHA-like multiple-access broadcast channels"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/22747\/01057022.pdf?arnumber=1057022","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,21]],"date-time":"2025-07-21T18:07:45Z","timestamp":1753121265000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1057022\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,3]]},"references-count":64,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tit.1985.1057022","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,3]]}}}