ISIT 2026 Workshop on Coding for New Applications
This workshop is part of IEEE ISIT 2026 in Guangzhou, China. We seek original completed and unpublished work not currently under review by any other journal/magazine/conference.
Important Dates
| Paper submission deadline | 7 April 2026 (firm) |
| Notification of acceptance | 21 April 2026 |
| Final manuscripts due | 28 April 2026 |
| Workshop date | 3 July 2026 |
Scope
Since Shannon’s seminal work, coding theory has been a central pillar of information theory and has powered generations of communication systems. Looking ahead, information processing and communication is moving beyond the classical AWGN-centric paradigm and is increasingly shaped by application-driven requirements. Emerging scenarios call for advances in coding theory and coded modulation across:
- Advanced waveforms (e.g., OTFS, FTN, ODDM, AFDM) requiring waveform-aware code design and decoding
- Integrated sensing and communication (ISAC) calling for strategies that jointly ensure reliable data delivery and accurate sensing/localization
- Coded computing for distributed learning, large-scale processing, and storage with straggler resilience and low latency
- Multi-user access (e.g., NOMA, RSMA, massive random access) requiring new multi-user codes and joint detection/decoding
- AI-native systems demanding information-theoretic and coding tools for compression, efficient/robust training, and interpretability
Topics of Interest
Topics include, but are not limited to:
- Information-theoretic limits and performance analysis in emerging application environments
- Coding theory for new application domains
- Code constructions and decoding algorithms tailored to new waveform designs, and joint optimization of waveform and coding strategies
- Coding for integrated communication, sensing, and localization, including trade-off analysis and unified design frameworks
- Coded computing for distributed learning, data storage, and large-scale computation
- Coding for multi-user access scenarios (e.g., NOMA, RSMA, massive random access) and adaptation of single-user codes to multi-user detection and joint decoding frameworks
- Low-complexity decoding for practical implementation under latency, memory, and power constraints
- Near-ML decoding for diverse short codes under application-driven constraints
- Coding for energy-efficient, secure, and privacy-preserving communications
- Compression and error-correcting codes for machine learning (data/representation compression; robust training/aggregation)
Invited Talks
| Baoming Bai |
Xidian University, China Design of GC-LDPC Codes for Integrated Satellite-and-Terrestrial Networks |
| Peter Trifonov |
ITMO University, Russia Low complexity decoding of polar codes with large kernels |
Organizing Committee
- Xiao Ma (Sun Yat-sen University, China)
- Richard D. Wesel (University of California, Los Angeles, United States)
- Linqi Song (City University of Hong Kong, Hong Kong SAR, China)
- Qianfan Wang (City University of Hong Kong, Hong Kong SAR, China)
- Huazi Zhang (Huawei Technologies Co., Ltd., China)
- Shuangyang Li (Technical University of Berlin, Germany)
- Peihong Yuan (Fudan University, China)
- Giuseppe Caire (Technical University of Berlin, Germany)
- Baoming Bai (Xidian University, China)
- Jinhong Yuan (The University of New South Wales, Australia)
Contact
For questions, please email: qwang742@cityu.edu.hk