{"id":"https://openalex.org/W3080963765","doi":"https://doi.org/10.1109/isit44484.2020.9174336","title":"Minimum Feedback for Collision-Free Scheduling in Massive Random Access","display_name":"Minimum Feedback for Collision-Free Scheduling in Massive Random Access","publication_year":2020,"publication_date":"2020-06-01","ids":{"openalex":"https://openalex.org/W3080963765","doi":"https://doi.org/10.1109/isit44484.2020.9174336","mag":"3080963765"},"language":"en","primary_location":{"id":"doi:10.1109/isit44484.2020.9174336","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit44484.2020.9174336","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5065552564","display_name":"Justin Kang","orcid":"https://orcid.org/0000-0002-3977-6848"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Justin Kang","raw_affiliation_strings":["University of Toronto,Department of Electrical and Computer Engineering","Department of Electrical and Computer Engineering, University of Toronto"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Toronto,Department of Electrical and Computer Engineering","institution_ids":["https://openalex.org/I185261750"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Toronto","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004681822","display_name":"Wei Yu","orcid":"https://orcid.org/0000-0002-7453-422X"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Wei Yu","raw_affiliation_strings":["University of Toronto,Department of Electrical and Computer Engineering","Department of Electrical and Computer Engineering, University of Toronto"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Toronto,Department of Electrical and Computer Engineering","institution_ids":["https://openalex.org/I185261750"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Toronto","institution_ids":["https://openalex.org/I185261750"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3122,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.5742052,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"2989","last_page":"2994"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12079","display_name":"IoT Networks and Protocols","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12079","display_name":"IoT Networks and Protocols","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11458","display_name":"Advanced Wireless Communication Technologies","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/random-access","display_name":"Random access","score":0.7819802165031433},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6500870585441589},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5788013935089111},{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.5645589828491211},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.5251797437667847},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.47947344183921814},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.42856526374816895},{"id":"https://openalex.org/keywords/base-station","display_name":"Base station","score":0.4196189343929291},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3883504867553711},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3499244451522827},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.32577815651893616},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2948891520500183},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2676376402378082},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.1545182466506958}],"concepts":[{"id":"https://openalex.org/C101722063","wikidata":"https://www.wikidata.org/wiki/Q218825","display_name":"Random access","level":2,"score":0.7819802165031433},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6500870585441589},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5788013935089111},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.5645589828491211},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.5251797437667847},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.47947344183921814},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.42856526374816895},{"id":"https://openalex.org/C68649174","wikidata":"https://www.wikidata.org/wiki/Q1379116","display_name":"Base station","level":2,"score":0.4196189343929291},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3883504867553711},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3499244451522827},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.32577815651893616},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2948891520500183},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2676376402378082},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.1545182466506958},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit44484.2020.9174336","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit44484.2020.9174336","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W952166399","https://openalex.org/W1972949703","https://openalex.org/W1988969816","https://openalex.org/W1995096771","https://openalex.org/W1996172330","https://openalex.org/W2029773437","https://openalex.org/W2045554673","https://openalex.org/W2053816258","https://openalex.org/W2056884477","https://openalex.org/W2061225176","https://openalex.org/W2065024926","https://openalex.org/W2074728115","https://openalex.org/W2075200743","https://openalex.org/W2127820195","https://openalex.org/W2141804605","https://openalex.org/W2143478908","https://openalex.org/W2742359230","https://openalex.org/W2753791741","https://openalex.org/W2784331297","https://openalex.org/W2890736047","https://openalex.org/W2950513899","https://openalex.org/W2963128632","https://openalex.org/W3135158731","https://openalex.org/W4251670373","https://openalex.org/W4394660149","https://openalex.org/W6791316763","https://openalex.org/W6864734183"],"related_works":["https://openalex.org/W4376608589","https://openalex.org/W3138003926","https://openalex.org/W4300037846","https://openalex.org/W1630514295","https://openalex.org/W1537073411","https://openalex.org/W2963081352","https://openalex.org/W2472555608","https://openalex.org/W4376608938","https://openalex.org/W4288275998","https://openalex.org/W4214498971"],"abstract_inverted_index":{"This":[0],"paper":[1,113],"considers":[2],"a":[3,9,19,32,60,103,150,161,170,183,200],"massive":[4,217],"random":[5,11,151,218],"access":[6],"scenario":[7],"where":[8],"small":[10],"set":[12,48,172],"of":[13,18,22,49,72,86,102,106,125,159,168,173,182,198],"k":[14,92,95,108],"active":[15,50,67],"users":[16,26,51,68,93],"out":[17],"larger":[20],"number":[21,124],"n":[23,188],"total":[24],"potential":[25],"seek":[27],"to":[28,31,64,90,119,166,196],"transmit":[29],"data":[30,75],"base":[33,43],"station.":[34],"Specifically,":[35],"we":[36],"examine":[37],"an":[38,54,135,179],"approach":[39],"in":[40,94,132],"which":[41],"the":[42,47,66,70,83,122,157,191,208],"station":[44],"first":[45],"determines":[46],"based":[52,148],"on":[53,149],"uplink":[55],"pilot":[56],"phase,":[57],"then":[58],"broadcasts":[59],"common":[61,87,127],"feedback":[62,88,110,128,164],"message":[63],"all":[65],"for":[69,214],"scheduling":[71],"their":[73],"subsequent":[74],"transmissions.":[76],"Our":[77],"main":[78],"question":[79],"is:":[80],"What":[81],"is":[82,147,193],"minimum":[84,123],"amount":[85],"needed":[89],"schedule":[91],"slots":[96],"while":[97],"completely":[98],"avoiding":[99],"collisions?":[100],"Instead":[101],"naive":[104],"scheme":[105],"using":[107],"log(n)":[109],"bits,":[111],"this":[112],"presents":[114],"upper":[115],"and":[116],"lower":[117],"bounds":[118],"show":[120],"that":[121,138,167,177,197],"required":[126],"bits":[129],"scales":[130,139],"linearly":[131],"k,":[133],"plus":[134],"additive":[136],"term":[137],"only":[140],"as":[141],"\u0398(log":[142],"log(n)).":[143],"The":[144],"achievability":[145],"proof":[146],"coding":[152],"argument.":[153],"We":[154],"further":[155],"connect":[156],"problem":[158,192],"constructing":[160],"minimal":[162,171,201],"length":[163],"code":[165,212],"finding":[169,199],"complete":[174,185],"k-partite":[175],"subgraphs":[176],"form":[178],"edge":[180],"covering":[181],"k-uniform":[184],"hypergraph":[186],"with":[187],"vertices.":[189],"Moreover,":[190],"also":[194],"equivalent":[195],"perfect":[202,210],"hashing":[203,211],"family,":[204],"thus":[205],"allowing":[206],"leveraging":[207],"explicit":[209],"constructions":[213],"achieving":[215],"collision-free":[216],"access.":[219]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}