Program
Monday, September 29
Monday, September 29 9:00 - 12:30
Tut01: Tutorial 1
- 09:00-10:30: Part 1
- 10:30-11:00: COFFEE BREAK
- 11:00-12:30: Part 2
Monday, September 29 9:00 - 12:30
Tut02: Tutorial 2
- 09:00-10:30: Part 1
- 10:30-11:00: COFFEE BREAK
- 11:00-12:30: Part 2
Monday, September 29 12:30 - 14:00
LUNCH (provided)
Monday, September 29 14:00 - 17:30
Tut03: Tutorial 3
- 14:00-15:30: Part 1
- 15:30-16:00: COFFEE BREAK
- 16:00-17:30: Part 2
Monday, September 29 14:00 - 17:30
Tut04: Tutorial 4
- 14:00-15:30: Part 1
- 15:30-16:00: COFFEE BREAK
- 16:00-17:30: Part 2
Monday, September 29 18:00 - 20:00
Welcome Reception
The reception is included in the registration, and will be held at the Zeta Bar, Hilton Hotel, Sydney.
Tuesday, September 30
Tuesday, September 30 8:30 - 9:30
P1: Plenary: Wireless
Tuesday, September 30 9:40 - 12:50
TM1: Coding for 6G
- 9:40 Improved Successive Cancellation Decoding of Polar Codes Through Perturbing A Posteriori LLRs
- 10:00 Rate-Matching Deep Polar Codes via Extension
- 10:20 PAC Codes Meet CRC-Polar Codes
- 10:40 Bounds and Constructions of High-Memory Spatially-Coupled Codes
- 11:00 COFFEE BREAK
- 11:30 SCL^2 Decoding of eBCH Based U-UV Codes
- 11:50 Polar Code Design for MIMO-OFDM with Channel Sparsity
- 12:10 Half Spatially Coupled Turbo-Like Codes
- 12:30 On the Convergence Speed of Spatially Coupled LDPC Ensembles Under Window Decoding
Tuesday, September 30 9:40 - 12:50
TM2: Combinatorics and Information Theory
- 9:40 Optimal tables for asymmetric numeral systems
- 10:00 Entropy Vectors on a Four-dimensional Face of \(Gamma_3\)
- 10:20 On the Intersections of \(q\)-ary Hamming Balls
- 10:40 Understanding the Ratio of the Partition Sum to its Bethe Approximation via Double Covers
- 11:00 COFFEE BREAK
- 11:30 Group Testing under Correlation: Leveraging Inference for High Infection Scenarios
- 11:50 The Labeled Coupon Collector Problem
- 12:10 Single-Letter Mismatched Decoding Rates with Memory for the Gilbert-Elliott Channel
Tuesday, September 30 9:40 - 12:50
TM3: Network Information Theory
- 9:40 Uniquely-Decodable Coding for Network Function Computation
- 10:00 Towards a Compositional Theory of Channels that Preserve Functions
- 10:20 Rate Region of Semantic-Aware Quadratic Gaussian Two-Terminal Source Coding Problem
- 10:40 Optimal Feedback Schemes for Dirty Paper Channels With State Estimation at the Receiver
- 11:00 COFFEE BREAK
- 11:30 Capacity-Key Tradeoff in Covert Communication
- 11:50 Secure Broadcasting under Unreliable Cooperation
- 12:10 A Dichotomy for Distributed Detection With Limited Communication
Tuesday, September 30 12:50 - 14:10
LUNCH (provided)
Tuesday, September 30 14:10 - 17:20
TA1: Wireless Communication and Networks
- 14:10 A New Soft-Decision Decoding for Extended BCH Codes Based on Reed-Muller Decomposition
- 14:30 Downlink Cell-Free MIMO using Distributed Integer-forcing
- 14:50 Discrete Age Analysis of Ber/G/1/1 Queues: Exact Expressions and Optimization
- 15:10 On Design and Analysis of Asynchronous Repetition Slotted ALOHA for Massive Access
- 15:30 COFFEE BREAK
- 16:00 Coding for Quasi-Static Fading Channel with Imperfect CSI at the Transmitter and Quantized Feedback
- 16:20 Structured Estimators: A New Perspective on Information Freshness
- 16:40 Achievable Rates for State-Dependent Discrete Memoryless Channels Under Coded Sensing
Tuesday, September 30 14:10 - 17:20
TA2: Source Coding
- 14:10 RDD Function: A Tradeoff Between Rate and Distortion-in-Distortion
- 14:30 Estimating Rate-Distortion Functions Using the Energy-Based Model
- 14:50 Universal Rate-Distortion-Classification Representations for Lossy Compression
- 15:10 Improved Lossless Compression based on Polar Codes
- 15:30 Coffee break
- 16:00 Non-Asymptotic Achievable Rate-Distortion Region for Indirect Wyner-Ziv Source Coding
- 16:20 Round-Preserving Asymptotic Compression of Prior-Free Interactive Protocols
- 16:40 Fundamental Limits on Overflow Probability for Variable-Length Codes with Codeword Cost: A Smooth Renyi Entropy Approach
- 17:00 On Distributionally Robust Lossy Source Coding
Tuesday, September 30 14:10 - 17:20
TA3: Privacy
- 14:10 An Information Geometric Approach to Local Information Privacy with Applications to Max-lift and Local Differential Privacy
- 14:30 Necessity of Block Designs for Optimal Locally Private Distribution Estimation
- 14:50 Between Close Enough to Reveal and Far Enough to Protect: a New Privacy Region for Correlated Data
- 15:10 Optimizing Privacy-Utility Trade-off in Decentralized Learning with Generalized Correlated Noise
- 15:30 Coffee break
- 16:00 Reveal-or-Obscure: A Differentially Private Sampling Algorithm for Discrete Distributions
- 16:20 Source Anonymity for Private Random Walk Decentralized Learning
- 16:40 Perfectly-Private Analog Secure Aggregation in Federated Learning
- 17:00 Efficient Machine Unlearning by Model Splitting and Core Sample Selection
Wednesday, October 1
Wednesday, October 1 8:30 - 9:30
P2: Plenary: Quantum
Wednesday, October 1 9:40 - 12:50
WM1: Quantum 1
- 9:40 A Simple Derivation of The Refined Sphere-Packing Bound for Classical-Quantum Channels
- 10:00 On the Error Exponent Distribution of Code Ensembles over Classical-Quantum Channels
- 10:20 Bounds in the Projective Unitary Group with Respect to Global Phase Invariant Distance
- 10:40 On two-point rational AG codes with Hermitian hull dimension lower bounded
- 11:00 COFFEE BREAK
- 11:30 Interpolation of Quantum Polar Codes and Quantum Reed-Muller Codes
- 11:50 Data Transmission over a Bosonic Arbitrarily Varying Quantum Channel
- 12:10 On the Interference Channel with Entangled Transmitters
- 12:30 A General Construction of the Transfer Matrices of $(k, N+t)$-Sum Boxes
Wednesday, October 1 9:40 - 12:50
WM2: Communication Theory
- 9:40 The Second-Order Coding Rate of Identification via Simple-Dispersion DMCs with Feedback
- 10:00 Global and Efficient Local Optimization for Movable Antenna Enabled ISAC
- 10:20 Information Freshness in Dynamic Gossip Networks
- 10:40 Rate-Reliability Region of Sequential Beam Alignment and Communication
- 11:00 COFFEE BREAK
- 11:30 Communication via Sensing
- 11:50 On Universal Decoding over Discrete Additive Channels by Noise Guessing
- 12:10 Characterization of Deletion/Substitution Channel Capacity for Small Deletion and Substitution Probabilities
Wednesday, October 1 9:40 - 12:50
WM3: Coding Theory for Biology and DNA Storage
- 9:40 Correcting Errors in Composite DNA: Channel Model and Code Design
- 10:00 On Levenshtein's Reconstruction Problem for Channels with Unique Insertion Error Patterns
- 10:20 A Converse For the Capacity of the Shotgun Sequencing Channel with Erasures
- 10:40 Identification over Affine Poisson Channels: Application to Molecular Mixture Communication Systems
- 11:00 COFFEE BREAK
- 11:30 On Achievable Rates Over Noisy Nanopore Channels
- 11:50 Two-deletion correcting codes for nanopore sequencing
Wednesday, October 1 12:50 - 14:10
LUNCH (provided)
Thursday, October 2
Thursday, October 2 8:30 - 9:30
P3: Plenary: Information Theory and AI
Over the past decade there has been a significant effort to improve Large Language Models (LLMs) performance. The fundamental aspect of training LLMs is next-word prediction over a large corpus as measured by the resulting perplexity. Models with lower perplexity consistently improve performance across a variety of downstream tasks including reasoning, coding, and question-answering. In this talk we review existing perplexity-reduction approaches, and show how information-theoretic, syntactical, statistical, and diversification-based techniques may help further reduce the LLM perplexity for the common WikiText-103 benchmark.
Thursday, October 2 9:40 - 12:50
ThM1: Information Theory in ML
- 9:40 The Bandit Channel
- 10:00 Information-Theoretic Minimax Regret Upper Bounds for Reinforcement Learning Problems
- 10:20 Incomplete Multiview Learning via Wyner Common Information
- 10:40 A DPI-PAC-Bayesian Framework for Generalization Bounds
- 11:00 COFFEE BREAK
- 11:30 The Role of Rank in Mismatched Low-Rank Symmetric Matrix Estimation
- 11:50 Generalized Dual Discriminator GANs
- 12:10 Dynamical Linear Reward Systems under Competitive Horizon Criteria
- 12:30 A Decoder with Reinforcement Learning Feedback
Thursday, October 2 9:40 - 12:50
ThM2: Security 1
- 9:40 Private Aggregation for Byzantine-Resilient Heterogeneous Federated Learning
- 10:00 Collusion-Resilient Hierarchical Secure Aggregation with Heterogeneous Security Constraints
- 10:20 Covert Computation over Gaussian Multiple-Access Channel with Feedback
- 10:40 Capacity Region for Covert Secret Key Generation over Multiple Access Channels
- 11:00 COFFEE BREAK
- 11:30 Secret key generation and Storage based on QPUF
- 11:50 An Efficient Hybrid Key Exchange Mechanism
- 12:10 A Monoid Ring Approach to Color Visual Cryptography
- 12:30 On the Size of a Share for Non-perfect Secret Sharing Schemes
Thursday, October 2 9:40 - 12:50
ThM3: Quantum 2
- 9:40 Towards Quantum Universal Hypothesis Testing
- 10:00 Quickest Change-point Detection With Continuous-Variable Quantum States
- 10:20 An Efficient Alternating Minimization Algorithm for Computing Quantum Rate-Distortion Function
- 10:40 Empirical Coordination of Quantum Correlations
- 11:00 COFFEE BREAK
- 11:30 A Fast Parallel Decoder for LDPC Codes Suitable for Burst Errors in QKD Reconciliation
- 11:50 On Finite-Blocklength Noisy Classical-Quantum Channel Coding With Amplitude Damping Errors
- 12:10 Entanglement-Assisted Coding for Arbitrary Linear Computations Over a Quantum MAC
- 12:30 An Improved Decimation Technique for Erasure Decoding of Quantum LDPC Codes
Thursday, October 2 12:50 - 14:10
LUNCH (provided)
Thursday, October 2 14:10 - 17:20
ThA1: Compressed Sensing and Statistics
- 14:10 Optimal Non-Adaptive Group Testing with One-Sided Error Guarantees
- 14:30 Minimax Data Sanitization with Distortion Constraint and Adversarial Inference
- 14:50 Efficient Algorithm for Sparse Fourier Transform of Generalized \(q\)-ary Functions
- 15:10 Noisy Bilinear Low-Rank Matrix Sketching
- 15:30 COFFEE BREAK
- 16:00 Polynomial Representation of Entropic Structures in Markov chain
- 16:20 Typicality with Feedback
Thursday, October 2 14:10 - 17:20
ThA2: Coding Theory 1
- 14:10 BiD Codes: Algebraic Codes from 3 x 3 Kernel
- 14:30 On the Derivative Structure of Euclidean Geometry Codes
- 14:50 Perturbed Derivative Decoding Based on Ordered Statistics for Cyclic Codes
- 15:10 Efficient Construction of MRD Codes Based on Circular-Shift Operations
- 15:30 COFFEE BREAK
- 16:00 Improving Smoothness in Huffman Coding: Canonical and Pre-allocated Variations
- 16:20 Grid-like Error-Correcting Codes for Matrix Multiplication with Better Correcting Capability
- 16:40 Non-Binary Polar Coded Quantization for Lossy Source Coding
Thursday, October 2 14:10 - 17:20
ThA3: Networks
- 14:10 Secrecy and Privacy in Multi-Access Coded Caching with Combinatorial Topology
- 14:30 On Hierarchical Coded Caching with Offline Users
- 14:50 Strong Converse for Distributed Source Encryption under Standard Mutual Information
- 15:10 Meta-Transfer Learning-based Few-Shot Data Detection for Resistive Memory Channels
- 15:30 COFFEE BREAK
- 16:00 Latency-Optimal File Assignment in Geo-Distributed Storage with Preferential Demands
- 16:20 New Construction of Matrix Representation of Finite Fields and Its Application to Linear Codes
- 16:40 Communication-Constrained Private Decentralized Online Personalized Mean Estimation
- 17:00 Learning to Write on Dirty Paper
Thursday, October 2 18:30 - 21:30
Banquet
The banquet dinner is included in the registration, and will be held at the Stateroom, Hilton Hotel, Sydney.
Friday, October 3
Friday, October 3 8:30 - 9:30
P4: Plenary: Coding
Friday, October 3 9:40 - 12:50
FM1: Coding for Communication and Storage
- 9:40 Robust Dynamic Coded Distributed Storage with Partially Storage Constrained Servers
- 10:00 Asymptotically Optimal Repair of Reed-Solomon Codes with Small Sub-Packetization under Rack-Aware Model
- 10:20 Minimum Distance Decoding for Reed-Muller Codes using Projection-Aggregation
- 10:40 Improved Coded Caching Scheme for Multi-User Information Retrieval System
- 11:00 COFFEE BREAK
- 11:30 Error Correcting Codes for Segmented Burst-Deletion Channels
- 11:50 On Plotkin Bound for Function-Correcting Codes for b-Symbol Read Channels
- 12:10 Constructions of Binary Cooperative MSR Codes with Optimal Access Bandwidth
- 12:30 A Matrix Completion Approach for the Construction of MDP Convolutional Codes
Friday, October 3 9:40 - 12:50
FM2: Detection, Estimation, and Testing
- 9:40 Approximate Hypothesis Testing
- 10:00 Secure Best Arm Identification In the Presence of a Copycat
- 10:20 Estimation Error: Distribution and Pointwise Limits
- 10:40 Estimating Mixture Distributions via Stochastic Mirror Descent
- 11:00 COFFEE BREAK
- 11:30 A Dual Optimization View to Empirical Risk Minimization with f-Divergence Regularization
- 11:50 The Conditional Regret-Capacity Theorem for Batch Universal Prediction
Friday, October 3 9:40 - 12:50
FM3: Security 2
- 9:40 \(\alpha\)-leakage Interpretation of Sibson Mutual Information and R\'{e}nyi Capacity
- 10:00 Data Availability Attacks: Targeted Sampling for 2-D Reed-Solomon Codes in Blockchain Systems
- 10:20 On Securing Berrut Approximated Coded Computing Through Discrete Cosine Transforms
- 10:40 Covert Entanglement Generation and Secrecy
- 11:00 COFFEE BREAK
- 11:30 Optimal Rate Region for Lazy Secret Sharing
- 11:50 Byzantine-Resilient Distributed Computation via Task Replication and Local Computations
- 12:10 FORTA: Byzantine-Resilient FL Aggregation via DFT-Guided Krum
Friday, October 3 12:50 - 14:10
LUNCH (provided)
Friday, October 3 14:10 - 15:30
FA1: Shannon Theory
- 14:10 Class-Based Expurgation Attains Csiszár's Expurgated Source-Channel Exponent
- 14:30 Resolution Limits of Non-Adaptive 20 Questions Estimation for Tracking Multiple Moving Targets
- 14:50 Remote Channel Synthesis
- 15:10 Dual-Domain Exponent of Maximum Mutual Information Decoding
Friday, October 3 14:10 - 15:30
FA2: Emerging Topics in Information Theory
- 14:10 Cross Mutual Information
- 14:30 Context-Aware Search and Retrieval Over Erasure Channels
- 14:50 Generalized Theta Series of a Lattice
- 15:10 Integrating Viterbi-Like Algorithms with Neural Networks for Resynchronizing Permutation Codes
Friday, October 3 14:10 - 15:30
FA3: Coding Theory 2
- 14:10 From One-Dimensional Codes to Two-Dimensional Codes: A Universal Framework for the Bounded-Weight Constraint
- 14:30 Permutation Reconstructions for Deletion Channels
- 14:50 Function-Correcting Codes for Locally Bounded Functions
- 15:10 Efficient Computation of Marton's Error Exponent via Constraint Decoupling
