SYSU International Workshop on Mathematics and Coding
Information coding is the key for modern communications, and coding is founded on mathematics. For example, classic channel codes are founded on linear algebra, while modern channel codes have been facilitated by probability theory and graph theory. The understanding of network coding requires both linear algebra and graph theory. This workshop aims to look back at the mathematics that we have used for designing and practicing codes, so that we can better look forward. This will be a hybrid conference where overseas scholars will participate online, and domestic ones will be onsite. All are welcome!
Organizers: IEEE Information Theory Society Guangzhou Chapter, School of Electronics and Information Technology of Sun Yat-sen University
Chairs: Pingzhi Fan, Li Chen
Venue: Sun Yat-sen University Kaifeng Hotel, Guangzhou, China. Access link will be provided for oversea registrants.
Dates: Dec 2-3, 2020, Beijing Time
Local Arrangements: Xijun Wang, Congduan Li, Shiqiu Liu, Yunqi Wan
Registration: Please send email to [email protected] by Nov. 17, 2020, with “SYSU International Workshop on Mathematics and Coding Registration” as the email subject. Your content should include name, titles and affiliations. Access link will be sent to the registrants via email.
Program
|
Beijing Time |
Speakers |
|
Dec. 2 |
|
|
Morning, Moderator: Li Chen |
|
|
8:30-8:35 |
Opening |
|
8:35-9:20 |
Alexander Barg, University of Maryland (Dec. 1, 19:35-20:20) Stolarsky's invariance principle for the Hamming space and energy maximization |
|
9:20-10:05 |
Jun Chen, McMaster University (Dec. 1, 20:20-21:05) On the Duality Between Slepian-Wolf Coding and Channel Coding |
|
10:05-10:30 |
Coffee break |
|
10:30-11:15 |
Krishna Narayanan, Texas A&M University (Dec. 1, 20:30-21:05) Sub-string matching in sub-linear time using sparse graph codes and sparse Fourier transforms |
|
11:15-12:00 |
Paul Siegel, University of California, San Diego (Dec. 1, 19:15-20:00) Coding for Efficient DNA Synthesis |
|
12:00-14:00 |
Photo & Lunch |
|
Afternoon, Moderator: Pingzhi Fan |
|
|
14:00-14:45 |
Erdal Arıkan, Bilkent University （Dec. 2, 9:00-9:45） Polarization Adjusted Convolutional (PAC) Codes |
|
14:45-15:30 |
Martin Bossert, Ulm University （Dec. 2, 7:45-8:30） On Information Set Decoding of BCH Codes over Binary Symmetric Channel |
|
15:30-16:00 |
Coffee break |
|
16:00-16:45 |
Bob Li, University of Electronic Science and Technology of China Commutative Algebra in Network Coding |
|
16:45-17:30 |
Li Chen, Sun Yat-sen University The Gröbner Bases in Decoding of Reed-Solomon Codes |
|
Dec. 3 |
|
|
Morning, Moderator: Li Chen |
|
|
8:30-9:15 |
Frank Kschischang, University of Toronto (Dec. 2, 19:30-20:15) Zipper Codes |
|
9:15-10:00 |
Dmitry Trukhachev, Dalhousie University (Dec. 2, 21:15-22:00) Braided Block Codes, Structural Relation to Zipper Codes and Fiber-Optical Communications Aspects |
|
10:00-10:30 |
Coffee break |
|
10:30-11:15 |
Hamid Ebrahimzad, Huawei, Canada (Dec. 2, 21:30-22:15) Concatenated polar-zipper code in optical communication |
|
11:15-12:00 |
Kai Niu, Beijing University of Post and Telecommunications Polar Spectrum: A Bridge between Polar Codes and Algebraic Codes |
|
12:00-14:00 |
Lunch |
|
Afternoon, Moderator: Pingzhi Fan |
|
|
14:00-14:45 |
Peter Trifonov, Saint Petersburg Polytech. University (Dec. 3, 9:00-9:45) Trellises, BCH codes, Finite Fields and Successive Cancellation Decoding |
|
14:45-15:30 |
Pingyi Fan, Tsinghua University MIM-GAN: Interpretable Generative Adversarial Networks with Exponential Function |
|
15:30-16:00 |
Coffee break |
|
16:00-16:45 |
Fangwei Fu, Nankai University Optimal Cyclic (r, δ) Locally Repairable Codes with Unbounded Length |
|
16:45-17:30 |
Raymond Leung, Huawei Coding: Not only Mathematics |