Application-Driven Coding Theory

Program

Error-Correcting Codes: Theory and Practice

Location

Calvin Lab auditorium

Date

Monday, Mar. 4 – Friday, Mar. 8, 2024

Back to calendar

8:30 – 9 a.m.

Coffee and Check-in

9 – 9:40 a.m.

Learning To Communicate

Robert Calderbank (Duke University)

9:45 – 10:10 a.m.

Maximizing Mutual Information in Flash Memories

Richard Wesel (UCLA)

10:15 – 10:45 a.m.

Break

10:45 – 11:10 a.m.

Precoded Polar Codes With High Error-Correction Capability

Vera Miloslavskaya (University of New England – Australia)

11:15 – 11:45 a.m.

Construction And Decoding Of Short Codes

Xiao Ma (Sun Yat-sen University)

11:45 a.m. – 2 p.m.

Lunch (on your own)

2 – 2:40 p.m.

Massive scaling in 6G designs

Jing Jiang (Qualcomm)

2:45 – 3:10 p.m.

From Short Pre-Coded Polar Codes To Longer Polar Codes

Mustafa Coskun (Nokia Bell Labs)

3:15 – 4:45 p.m.

Reception

8:30 – 9 a.m.

Coffee and Check-in

9 – 9:40 a.m.

Practical Error Control Coding For Data Storage

Mats Öberg (Marvell)

9:45 – 10:10 a.m.

Convertible codes: Adaptive coding for large-scale data storage

Rashmi Vinayak (Carnegie Mellon University)

10:15 – 10:45 a.m.

Break

10:45 – 11:10 a.m.

Towards Practical Polar Codes With Low Scaling Exponent

Peter Trifonov (ITMO University)

11:15 – 11:45 a.m.

Toward Efficient Genomic Compression Using Channel Codes For Joint Alignment And Reconstruction

Yuval Cassuto (Technion)

11:45 a.m. – 2 p.m.

Lunch (on your own)

2 – 2:40 p.m.

Using erasure codes to enable interactions over networks

Michael Luby (BitRipple, Inc.)

2:45 – 3:10 p.m.

Algebraic Coding Problems From Quantum Fault-Tolerance

Narayanan Rengaswamy (Universtiy of Arizona)

3:15 – 3:45 p.m.

Break

3:45 – 4:10 p.m.

Binary CSS-T codes: characterizations and posets

Gretchen Matthews (Virginia Tech)

4:15 – 4:40 p.m.

Open Discussion

8:30 – 9 a.m.

Coffee and Check-in

9 – 9:40 a.m.

Generalized Staircase Codes With Arbitrary Bit Degree

Mohannad Shehadeh (University of Toronto)

9:45 – 10:10 a.m.

Mackay-Neal Codes For High-Speed Wireless And Free-Space Optical Links

Gianluigi Liva (DLR)

10:15 – 10:45 a.m.

Break

10:45 – 11:10 a.m.

Interleaved Codes For Cryptography

Antonia Wachter-Zeh (TU Munich)

11:15 – 11:45 a.m.

Dynamic Denoising For Amp Applied To Sparse Regression Inner Codes With Outer Codes

Jean-Francois Chamberland (Texas A&M University)

11:45 a.m. – 2 p.m.

Lunch (on your own)

2 – 2:40 p.m.

Non-binary LDPC codes for Information Reconciliation in QKD Protocols

Lara Dolecek (UC Los Angeles)

2:45 – 3:10 p.m.

Low-Density Parity-Check Codes And Spatial Coupling For Quantitative Group Testing

Michael Lentmaier (Lund University)

3:15 – 3:45 p.m.

Break

3:45 – 4:40 p.m.

Lightning Talks

8:30 – 9 a.m.

Coffee and Check-in

9 – 9:40 a.m.

Cover Your Bases: How To Minimize The Sequencing Coverage In Dna Storage Systems

Eitan Yaakobi (Technion)

9:45 – 10:10 a.m.

Quantized-Constraint Concatenation And The Covering Radius Of Constrained Systems

Moshe Schwartz (McMaster University)

10:15 – 10:45 a.m.

Break

10:45 – 11:10 a.m.

Neural Distributed Source Coding

Hyeji Kim (The University of Texas at Austin)

11:15 – 11:45 a.m.

Polar Codes For Ids Channels

Ido Tal (Technion)

11:45 a.m. – 2 p.m.

Lunch (on your own)

2 – 2:40 p.m.

Coding For Dna Storage With Nanopore Sequencing

Emanuele Viterbo (Monash University)

2:45 – 3:10 p.m.

Coded matrix computation: numerical stability, partial stragglers and sparse input matrices

Aditya Ramamoorthy (Iowa State University)

3:15 – 3:45 p.m.

Break

3:45 – 4:10 p.m.

Approximate coding computing

Stark Draper (University of Toronto)

4:15 – 4:45 p.m.

Combinatorial Problems in Support Recovery for 1-bit Compressed Sensing

Arya Mazumdar (UC San Diego)

8:30 – 9 a.m.

Coffee and Check-in

9 – 9:40 a.m.

Service Rates Of Mds Codes & Fractional Matchings In Quasi-Uniform Hypergraphs

Emina Soljanin (Rutgers University)

9:45 – 10:10 a.m.

Sparsity and Privacy in Distributed Matrix Multiplication

Rawad Bitar (Technical University of Munich)

10:15 – 10:45 a.m.

Break

10:45 – 11:10 a.m.

Graph Neural Networks for Classical and Quantum Channel Coding

Sebastian Cammerer (Nvidia)

11:15 – 11:45 a.m.

High-Rate Fair-Density Parity-Check Codes

Hessam Mahdavifar (Northeastern University)

11:45 a.m. – 2 p.m.

Lunch (on your own)

2 – 2:40 p.m.

Data Deduplication For Redundant Graph Structures Files

Olgica Milenkovic (University of Illinois at Urbana-Champaign)

2:45 – 3:10 p.m.

Private Information Retrieval: Chasing Capacity with Algebraic Codes

Camilla Hollanti (Aalto University)

3:15 – 3:45 p.m.

Break

3:45 – 4:10 p.m.

Maximally Recoverable Codes

Lalitha Vadlamani (International Institute of Information Technology, Hyderabad)

4:15 – 4:45 p.m.

Open Discussion