A.4: Combinatorial Coding Theory I | |
Session Type: Lecture | |
Track: Algebraic and Combinatorial Coding Theory | |
Virtual Session: View on Virtual Platform | |
Session Chair: Navin Kashyap, Indian Institute of Science | |
A.4.1: Improved efficiency for covering codes matching the sphere-covering bound | |
Click here to download the manuscript | |
Click here to view the Virtual Presentation | |
Aditya Potukuchi; Rutgers, The State University of New Jersey | |
Yihan Zhang; The Chinese University of Hong Kong | |
A.4.2: Maximum Length of Robust Positioning Sequences | |
Click here to download the manuscript | |
Click here to view the Virtual Presentation | |
Duc Tu Dao; Nanyang Technological University | |
Han Mao Kiah; Nanyang Technological University | |
Hengjia Wei; Ben-Gurion University of the Negev | |
A.4.3: Distribution of the Minimum Distance of Random Linear Codes | |
Click here to download the manuscript | |
Click here to view the Virtual Presentation | |
Jing Hao; Georgia Institute of Technology | |
Han Huang; Georgia Institute of Technology | |
Galyna Livshyts; Georgia Institute of Technology | |
Konstantin Tikhomirov; Georgia Institute of Technology | |
A.4.4: The Capacity of Multidimensional Permutations with Restricted Movement | |
Click here to download the manuscript | |
Click here to view the Virtual Presentation | |
Dor Elimelech; Ben-Gurion University of the Negev | |
A.4.5: Uncertainty of Reconstructing Multiple Messages from Uniform-Tandem-Duplication Noise | |
Click here to download the manuscript | |
Click here to view the Virtual Presentation | |
Yonatan Yehezkeally; Ben-Gurion University of the Negev | |
Moshe Schwartz; Ben-Gurion University of the Negev | |
Plan Ahead
2021 IEEE International Symposium on Information Theory
11-16 July 2021 | Melbourne, Victoria, Australia