G.4: Group Testing and Sparse Codes | |
Session Type: Lecture | |
Track: Graphs, Games, Sparsity, and Signal Processing | |
Virtual Session: View on Virtual Platform | |
Session Chair: Ayfer Özgür, Stanford University | |
G.4.1: Improved non-adaptive algorithms for threshold group testing with a gap | |
Click here to download the manuscript | |
Click here to view the Virtual Presentation | |
Thach V. Bui; University of Science, VNU-HCMC, Ho Chi Minh City, Vietnam | |
Mahdi Cheraghchi; University of Michigan, Ann Arbor, MI, USA | |
Isao Echizen; National Institute of Informatics; The University of Tokyo, Tokyo, Japan | |
G.4.2: Near-Optimal Sparse Adaptive Group Testing | |
Click here to download the manuscript | |
Click here to view the Virtual Presentation | |
Nelvin Tan; National University of Singapore | |
Jonathan Scarlett; National University of Singapore | |
G.4.3: Fast Compressive Large-Scale Matrix-Matrix Multiplication Using Product Codes | |
Click here to download the manuscript | |
Click here to view the Virtual Presentation | |
Orhan Ocal; University of California at Berkeley | |
Kannan Ramchandran; University of California at Berkeley | |
G.4.4: Modulated Sparse Regression Codes | |
Click here to download the manuscript | |
Click here to view the Virtual Presentation | |
Kuan Hsieh; University of Cambridge | |
Ramji Venkataramanan; University of Cambridge | |
Plan Ahead
2021 IEEE International Symposium on Information Theory
11-16 July 2021 | Melbourne, Victoria, Australia