{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:24:04Z","timestamp":1743020644174,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031346705"},{"type":"electronic","value":"9783031346712"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-34671-2_15","type":"book-chapter","created":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T23:02:58Z","timestamp":1687302178000},"page":"200-215","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Robust Group Testing-Based Multiple-Access Protocol for Massive MIMO"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8514-979X","authenticated-orcid":false,"given":"George","family":"Vershinin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9567-5793","authenticated-orcid":false,"given":"Asaf","family":"Cohen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2685-2856","authenticated-orcid":false,"given":"Omer","family":"Gurewitz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,6,21]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"IEEE Standard for Information Technology-Telecommunications and Information Exchange between Systems Local and Metropolitan Area Networks-Specific Requirements Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications Amendment 1: Enhancements for High-Efficiency WLAN (2021). https:\/\/doi.org\/10.1109\/IEEESTD.2021.9442429. IEEE Std 802.11ax-2021","key":"15_CR1","DOI":"10.1109\/IEEESTD.2021.9442429"},{"issue":"6","key":"15_CR2","doi-asserted-by":"publisher","first-page":"3671","DOI":"10.1109\/TIT.2014.2314472","volume":"60","author":"M Aldridge","year":"2014","unstructured":"Aldridge, M., Baldassini, L., Johnson, O.: Group testing algorithms: bounds and simulations. IEEE Trans. Inf. Theory 60(6), 3671\u20133687 (2014). https:\/\/doi.org\/10.1109\/TIT.2014.2314472","journal-title":"IEEE Trans. Inf. Theory"},{"doi-asserted-by":"crossref","unstructured":"Aldridge, M., Johnson, O., Scarlett, J.: Group testing: an information theory perspective (2019)","key":"15_CR3","DOI":"10.1561\/9781680835977"},{"doi-asserted-by":"publisher","unstructured":"Atia, G., Saligrama, V.: Noisy group testing: an information theoretic perspective. In: 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton), pp. 355\u2013362 (2009). https:\/\/doi.org\/10.1109\/ALLERTON.2009.5394787","key":"15_CR4","DOI":"10.1109\/ALLERTON.2009.5394787"},{"issue":"3","key":"15_CR5","doi-asserted-by":"publisher","first-page":"1880","DOI":"10.1109\/TIT.2011.2178156","volume":"58","author":"GK Atia","year":"2012","unstructured":"Atia, G.K., Saligrama, V.: Boolean compressed sensing and noisy group testing. IEEE Trans. Inf. Theory 58(3), 1880\u20131901 (2012). https:\/\/doi.org\/10.1109\/TIT.2011.2178156","journal-title":"IEEE Trans. Inf. Theory"},{"doi-asserted-by":"publisher","unstructured":"Atia, G.K., Saligrama, V., Aksoylar, C.: Correction to \u201cBoolean compressed sensing and noisy group testing\u201d [Mar 12 1880\u20131901]. IEEE Trans. Inf. Theory 61(3), 1507\u20131507 (2015). https:\/\/doi.org\/10.1109\/TIT.2015.2392116","key":"15_CR6","DOI":"10.1109\/TIT.2015.2392116"},{"doi-asserted-by":"publisher","unstructured":"Chan, C., Che, P.H., Jaggi, S., Saligrama, V.: Non-adaptive probabilistic group testing with noisy measurements: near-optimal bounds with efficient algorithms. In: 2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton (2011). https:\/\/doi.org\/10.1109\/Allerton.2011.6120391","key":"15_CR7","DOI":"10.1109\/Allerton.2011.6120391"},{"doi-asserted-by":"publisher","unstructured":"Chan, C.L., Jaggi, S., Saligrama, V., Agnihotri, S.: Non-adaptive group testing: explicit bounds and novel algorithms. In: IEEE International Symposium on Information Theory Proceedings, pp. 1837\u20131841 (2012). https:\/\/doi.org\/10.1109\/ISIT.2012.6283597","key":"15_CR8","DOI":"10.1109\/ISIT.2012.6283597"},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-319-94147-9_11","volume-title":"Cyber Security Cryptography and Machine Learning","author":"A Cohen","year":"2018","unstructured":"Cohen, A., Cohen, A., Gurewitz, O.: Secured data gathering protocol for IoT networks. In: Dinur, I., Dolev, S., Lodha, S. (eds.) CSCML 2018. LNCS, vol. 10879, pp. 129\u2013143. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94147-9_11"},{"issue":"2","key":"15_CR10","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1109\/TNET.2020.2964764","volume":"28","author":"A Cohen","year":"2020","unstructured":"Cohen, A., Cohen, A., Gurewitz, O.: Efficient data collection over multiple access wireless sensors network. IEEE\/ACM Trans. Netw. 28(2), 491\u2013504 (2020). https:\/\/doi.org\/10.1109\/TNET.2020.2964764","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"4003","DOI":"10.1109\/TIFS.2020.3029877","volume":"16","author":"A Cohen","year":"2021","unstructured":"Cohen, A., Cohen, A., Gurewitz, O.: Secure group testing. IEEE Trans. Inf. Forensics Secur. 16, 4003\u20134018 (2021). https:\/\/doi.org\/10.1109\/TIFS.2020.3029877","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"doi-asserted-by":"crossref","unstructured":"Du, D., Hwang, F.K., Hwang, F.: Combinatorial Group Testing and Its Applications, vol. 12. World Scientific (2000)","key":"15_CR12","DOI":"10.1142\/9789812798107"},{"doi-asserted-by":"publisher","unstructured":"Goldsmith, A.: Wireless Communications. Cambridge University Press (2005). https:\/\/doi.org\/10.1017\/CBO9780511841224","key":"15_CR13","DOI":"10.1017\/CBO9780511841224"},{"unstructured":"Gulasekaran, S., Sankaran, S.: Wi-Fi 6 Protocol and Network. Artech House Mobile Communications Library, Artech House (2022). https:\/\/books.google.co.il\/books?id=WXx4zgEACAAJ","key":"15_CR14"},{"issue":"4","key":"15_CR15","doi-asserted-by":"publisher","first-page":"951","DOI":"10.1109\/TIT.2003.809594","volume":"49","author":"B Hassibi","year":"2003","unstructured":"Hassibi, B., Hochwald, B.: How much training is needed in multiple-antenna wireless links? IEEE Trans. Inf. Theory 49(4), 951\u2013963 (2003). https:\/\/doi.org\/10.1109\/TIT.2003.809594","journal-title":"IEEE Trans. Inf. Theory"},{"doi-asserted-by":"publisher","unstructured":"Kampeas, J., Cohen, A., Gurewitz, O.: Rate analysis of distributed multiuser MIMO protocols for the 802.11ac. In: IEEE International Conference on the Science of Electrical Engineering (ICSEE), pp. 1\u20135 (2016). https:\/\/doi.org\/10.1109\/ICSEE.2016.7806096","key":"15_CR16","DOI":"10.1109\/ICSEE.2016.7806096"},{"doi-asserted-by":"publisher","unstructured":"Paquelet, S., Aubert, L.M., Uguen, B.: An impulse radio asynchronous transceiver for high data rates. In: International Workshop on Ultra Wideband Systems Joint with Conference on Ultra Wideband Systems and Technologies. Joint UWBST IWUWBS (IEEE Cat. No.04EX812), pp. 1\u20135 (2004). https:\/\/doi.org\/10.1109\/UWBST.2004.1320888","key":"15_CR17","DOI":"10.1109\/UWBST.2004.1320888"},{"doi-asserted-by":"crossref","unstructured":"Robin, J., Erkip, E.: Capacity bounds and user identification costs in Rayleigh-fading many-access channel. In: IEEE International Symposium on Information Theory (ISIT), pp. 2477\u20132482. IEEE (2021)","key":"15_CR18","DOI":"10.1109\/ISIT45174.2021.9517965"},{"doi-asserted-by":"publisher","unstructured":"Robin, J., Erkip, E.: Sparse activity discovery in energy constrained multi-cluster IoT networks using group testing. In: IEEE International Conference on Communications (ICC), pp. 1\u20136 (2021). https:\/\/doi.org\/10.1109\/ICC42927.2021.9500808","key":"15_CR19","DOI":"10.1109\/ICC42927.2021.9500808"},{"doi-asserted-by":"publisher","unstructured":"Roth, R.: Introduction to Coding Theory. Cambridge University Press (2006). https:\/\/doi.org\/10.1017\/CBO9780511808968","key":"15_CR20","DOI":"10.1017\/CBO9780511808968"},{"issue":"6","key":"15_CR21","doi-asserted-by":"publisher","first-page":"3775","DOI":"10.1109\/TIT.2020.2970184","volume":"66","author":"J Scarlett","year":"2020","unstructured":"Scarlett, J., Johnson, O.: Noisy non-adaptive group testing: a (near-)definite defectives approach. IEEE Trans. Inf. Theory 66(6), 3775\u20133797 (2020). https:\/\/doi.org\/10.1109\/TIT.2020.2970184","journal-title":"IEEE Trans. Inf. Theory"},{"doi-asserted-by":"crossref","unstructured":"Sejdinovic, D., Johnson, O.: Note on noisy group testing: asymptotic bounds and belief propagation reconstruction. In: 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton), pp. 998\u20131003. IEEE (2010)","key":"15_CR22","DOI":"10.1109\/ALLERTON.2010.5707018"},{"key":"15_CR23","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807213","volume-title":"Fundamentals of Wireless Communication","author":"D Tse","year":"2005","unstructured":"Tse, D., Viswanath, P.: Fundamentals of Wireless Communication. Cambridge University Press, Cambridge (2005)"},{"doi-asserted-by":"publisher","unstructured":"Vershinin, G., Cohen, A., Gurewitz, O.: Order-optimal joint transmission and identification in massive multi-user MIMO via group testing (2022). https:\/\/doi.org\/10.48550\/ARXIV.2210.00421","key":"15_CR24","DOI":"10.48550\/ARXIV.2210.00421"},{"key":"15_CR25","series-title":"Wireless Networks","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-51355-3","volume-title":"Index Modulation for 5G Wireless Communications","author":"M Wen","year":"2017","unstructured":"Wen, M., Cheng, X., Yang, L.: Index Modulation for 5G Wireless Communications. WN, 1st edn. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-51355-3","edition":"1"},{"issue":"12","key":"15_CR26","doi-asserted-by":"publisher","first-page":"7856","DOI":"10.1109\/TWC.2021.3088485","volume":"20","author":"X Xia","year":"2021","unstructured":"Xia, X., et al.: Joint user selection and transceiver design for cell-free with network-assisted full duplexing. IEEE Trans. Wirel. Commun. 20(12), 7856\u20137870 (2021). https:\/\/doi.org\/10.1109\/TWC.2021.3088485","journal-title":"IEEE Trans. Wirel. Commun."},{"issue":"5","key":"15_CR27","doi-asserted-by":"publisher","first-page":"2203","DOI":"10.1109\/TIT.2006.872984","volume":"52","author":"T Yoo","year":"2006","unstructured":"Yoo, T., Goldsmith, A.: Capacity and power allocation for fading MIMO channels with channel estimation error. IEEE Trans. Inf. Theory 52(5), 2203\u20132214 (2006). https:\/\/doi.org\/10.1109\/TIT.2006.872984","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"15_CR28","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1109\/JSAC.2005.862421","volume":"24","author":"T Yoo","year":"2006","unstructured":"Yoo, T., Goldsmith, A.: On the optimality of multiantenna broadcast scheduling using zero-forcing beamforming. IEEE J. Sel. Areas Commun. 24(3), 528\u2013541 (2006). https:\/\/doi.org\/10.1109\/JSAC.2005.862421","journal-title":"IEEE J. Sel. Areas Commun."},{"doi-asserted-by":"publisher","unstructured":"Zhang, J., Liu, M., Xiong, K., Zhang, M.: Near-optimal user clustering and power control for uplink MISO-NOMA networks. In: IEEE Global Communications Conference (GLOBECOM), pp. 01\u201306 (2021). https:\/\/doi.org\/10.1109\/GLOBECOM46510.2021.9685202","key":"15_CR29","DOI":"10.1109\/GLOBECOM46510.2021.9685202"}],"container-title":["Lecture Notes in Computer Science","Cyber Security, Cryptology, and Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-34671-2_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T12:20:48Z","timestamp":1710332448000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-34671-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031346705","9783031346712"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-34671-2_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"21 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSCML","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Cyber Security, Cryptology, and Machine Learning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Be'er Sheva","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Israel","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cscml2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cscml.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"70","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}