Minimum Feedback for Collision-Free Scheduling in Massive Random Access

IEEE Transactions on Information Theory（2021）

引用 13|浏览6

暂无评分

摘要

Consider a massive random access scenario in which a small set of $k$ active users out of a large number of $n$ potential users need to be scheduled in $b\ge k$ slots. What is the m...

查看译文

关键词

Codes,Scheduling,Decoding,Schedules,Payloads,Costs,Indexes

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要