Friday, August 22
Coffee and Pastries available
Keynote: Galen Reeves (Duke University, USA)
Title: Reed Muller Codes Achieve Capacity: Binary, Non-binary, and Beyond
Session: Codes and Graphs
Session Chair: Lara Dolecek (University of California, Los Angeles, USA)
| Ensemble Average Analysis of Non-Adaptive Group Testing with Sparse Pooling Graphs Emna Ben Yacoub (Huawei Munich Research Center, Germany); Gianluigi Liva (German Aerospace Center (DLR), Germany); Enrico Paolini and Marco Chiani (University of Bologna, Italy) |
| SASH: Decoding Community Structure in Graphs Allison Beemer (University of Wisconsin-Eau Claire, USA); Jessalyn Bolkema (California State University-Dominguez Hills, USA) |
| Graph Constructions of Error-Detecting Codes for Nanopore Sequencers Maciej Piwowarczyk and Christine A Kelley (University of Nebraska-Lincoln, USA) |
Coffee Break
Session: Algebraic Codes
Session chair: Richard Wesel (University of California, Los Angeles)
| Binary Images of Generalized Reed-Solomon Codes are Capacity Achieving Xiangping Zheng and Xiao Ma (Sun Yat-sen University, China) |
| On the Redundancy of Function-Correcting Codes over Finite Fields Hoang Ly Minh and Emina Soljanin (Rutgers University, USA) |
| Efficient Ordered Statistics Decoder with Unfolded Gaussian Elimination Leyu Zhang (University of Science and Technology of China, China); Yuqing Ren (EPFL, Switzerland); Chuan Zhang (National Mobile Communications Research Laboratory, Southeast University, China); Andreas Burg and Yifei Shen (EPFL, Switzerland) |
| A class of quasi-cyclic binary parity-check codes from Reed-Solomon codes Kathryn Haymaker (Villanova University, USA); Emily McMillon (Rice University, USA) |