Common Message Acknowledgments: Massive ARQ Protocols for Wireless Access
暂无分享,去创建一个
[1] Martin Dietzfelbinger,et al. Succinct Data Structures for Retrieval and Approximate Membership , 2008, ICALP.
[2] Po-Shen Loh,et al. Probabilistic Methods in Combinatorics , 2009 .
[3] Wei Yu,et al. Minimum Feedback for Collision-Free Scheduling in Massive Random Access , 2020, 2020 IEEE International Symposium on Information Theory (ISIT).
[4] Carsten Bockelmann,et al. Massive machine-type communications in 5g: physical and MAC-layer solutions , 2016, IEEE Communications Magazine.
[5] Larry Carter,et al. Exact and approximate membership testers , 1978, STOC.
[6] Peter C. Dillinger,et al. Fast Succinct Retrieval and Approximate Membership using Ribbon , 2021, SEA.
[7] Andrei Broder,et al. Network Applications of Bloom Filters: A Survey , 2004, Internet Math..
[8] Ely Porat,et al. An Optimal Bloom Filter Replacement Based on Matrix Solving , 2008, CSR.
[9] Petar Popovski,et al. ALOHA Random Access that Operates as a Rateless Code , 2013, IEEE Transactions on Communications.
[10] Anant Sahai,et al. (www.interscience.wiley.com) DOI: 10.1002/ett.0000 Variable-length channel coding with noisy feedback , 2022 .
[11] Sarah J. Johnson,et al. Massive Multiple Access Based on Superposition Raptor Codes for Cellular M2M Communications , 2017, IEEE Transactions on Wireless Communications.
[12] Rasmus Pagh,et al. Lossy Dictionaries , 2001, ESA.
[13] Nihar Jindal,et al. Coding versus ARQ in Fading Channels: How Reliable Should the PHY Be? , 2009, IEEE Transactions on Communications.
[14] Wei Yu,et al. Sparse Signal Processing for Grant-Free Massive Connectivity: A Future Paradigm for Random Access Protocols in the Internet of Things , 2018, IEEE Signal Processing Magazine.
[15] Marco Chiani,et al. Coded Slotted ALOHA: A Graph-Based Method for Uncoordinated Multiple Access , 2014, IEEE Transactions on Information Theory.
[16] Giuseppe Caire,et al. Pilot-Based Unsourced Random Access with a Massive MIMO Receiver in the Quasi-Static Fading Regime , 2020, 2021 IEEE 22nd International Workshop on Signal Processing Advances in Wireless Communications (SPAWC).
[17] Kai-Min Chung,et al. When Simple Hash Functions Suffice , 2020, Beyond the Worst-Case Analysis of Algorithms.
[18] Thomas M. Cover,et al. Enumerative source encoding , 1973, IEEE Trans. Inf. Theory.
[19] Erik G. Ström,et al. Short-Packet Transmission via Variable-Length Codes in the Presence of Noisy Stop Feedback , 2021, IEEE Transactions on Wireless Communications.
[20] Burton H. Bloom,et al. Space/time trade-offs in hash coding with allowable errors , 1970, CACM.
[21] Yury Polyanskiy,et al. A perspective on massive random-access , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).