Please note: all talks are 20 minutes. Sessions Tu-PM-14, Th-PM-7, Th-PM-16, and
Fr-PM-13 in the previous "PDF Final Program" file contained incorrectly listed
presentation start times. The program handed out at ISIT unfortunately also contains the
incorrect start times.
| |
| Sunday, July 6 |
|
09:00 - 12:00
|
| Tutorial: T-1: Information-theoretic security: theory and practice |
|
|
|
| Tutorial: T-2: Distributed source coding: Foundations, constructions and applications |
|
|
14:00 - 17:00
|
| Tutorial: T-3: Information exchange in viral infections: Applications to vaccine design |
|
|
|
| Tutorial: T-4: Networks' challenge: Where game theory meets network optimization |
|
| |
| Monday, July 7 |
|
08:30 - 09:30
|
| Plenary: A. Robert Calderbank, Princeton University |
|
|
09:50 - 11:10
|
| Mo-AM-1: Multi-Hop and Delay-Tolerant Networks |
|
|
|
| Mo-AM-2: Network Coding and Networking |
|
|
|
| Mo-AM-3: CEO Problem and Function Computation |
|
|
|
| Mo-AM-4: Decoding I |
|
|
|
| Mo-AM-5: Capacity of Quantum Channels |
|
|
|
| Mo-AM-6: Wiretap Channels |
|
|
|
| Mo-AM-7: Capacity of Fading Channels |
|
|
|
| Mo-AM-8: Iterative Decoding |
|
|
11:30 - 12:50
|
| Mo-AM-9: Secure Network Coding |
|
|
|
| Mo-AM-10: Wireless Networks |
|
|
|
| Mo-AM-11: Decoding II |
|
|
|
| Mo-AM-12: Signatures, Fingerprints, Watermarks |
|
|
|
| Mo-AM-13: Gaussian Interference Channel Capacity |
|
|
|
| Mo-AM-14: Fading Channels |
|
|
|
| Mo-AM-15: Theoretical Aspects of LDPC Codes |
|
|
|
| Mo-AM-16: Quantum Codes I |
|
|
14:40 - 16:00
|
| Mo-PM-1: Network Coding Capacity |
|
|
|
| Mo-PM-2: Capacity of Wireless Networks |
|
|
|
| Mo-PM-3: Quantum Codes II |
|
|
|
| Mo-PM-4: Secrecy and Interference |
|
|
|
| Mo-PM-5: Multiaccess Channels with Feedback |
|
|
|
| Mo-PM-6: Multi-terminal Source Coding |
|
|
|
| Mo-PM-7: Performance of LDPC Codes |
|
|
|
| Mo-PM-8: Iterative Estimation and Inference |
|
|
16:20 - 18:00
|
| Mo-PM-9: Relays: Capacity and Coding |
|
|
|
| Mo-PM-10: Statistical Physics |
|
|
|
| Mo-PM-11: Secrecy Capacity and Networks |
|
|
|
| Mo-PM-12: Interference Channels |
|
|
|
| Mo-PM-13: MIMO I |
|
|
|
| Mo-PM-14: Energy Efficiency and Power Control |
|
|
|
| Mo-PM-15: Special Problems in Coding |
|
|
|
| Mo-PM-16: Inference in Networks |
|
| |
| Tuesday, July 8 |
|
08:30 - 09:30
|
| Plenary: Alon Orlitsky, UCSD |
|
|
09:50 - 11:10
|
| Tu-AM-1: Delay in Networks |
|
|
|
| Tu-AM-2: Sergio Servetto Memorial Session |
|
|
|
| Tu-AM-3: Feedback I |
|
|
|
| Tu-AM-4: Secrecy and Key Agreement |
|
|
|
| Tu-AM-5: Gaussian Broadcast Channels and Networks |
|
|
|
| Tu-AM-6: Codes for Cooperation |
|
|
|
| Tu-AM-7: Design of LDPC Codes |
|
|
|
| Tu-AM-8: Error Control Codes for Network Coding I |
|
|
11:30 - 12:50
|
| Tu-AM-9: Space-Time Coding for Cooperative Networks |
|
|
|
| Tu-AM-10: Rate Distortion Coding and Theory |
|
|
|
| Tu-AM-11: Error Control Codes for Network Coding II |
|
|
|
| Tu-AM-12: Feedback II |
|
|
|
| Tu-AM-13: Multi-user MIMO |
|
|
|
| Tu-AM-14: Watermarks and Spectrum Sharing |
|
|
|
| Tu-AM-15: Non-Binary LDPC Codes |
|
|
|
| Tu-AM-16: Error Correction and Detection I |
|
|
14:40 - 16:00
|
| Tu-PM-1: Universal Source Coding |
|
|
|
| Tu-PM-2: Secret Key Generation |
|
|
|
| Tu-PM-3: LDPC Convolutional Codes and Woven Codes |
|
|
|
| Tu-PM-4: Error Correction and Detection II |
|
|
|
| Tu-PM-5: Space-Time Coding I |
|
|
|
| Tu-PM-6: Shannon, Gauss, Nyquist, and Euclid |
|
|
|
| Tu-PM-7: Estimation I |
|
|
|
| Tu-PM-8: Throughput Scaling |
|
|
16:20 - 18:00
|
| Tu-PM-9: LDPC Codes and Applications |
|
|
|
| Tu-PM-10: New Code Constructions |
|
|
|
| Tu-PM-11: Source-Channel Coding |
|
|
|
| Tu-PM-12: Capacity Characterization |
|
|
|
| Tu-PM-13: Estimation II |
|
|
|
| Tu-PM-14: Degrees of Freedom in Wireless Networks |
|
|
|
| Tu-PM-15: Space-Time Coding II |
|
|
|
| Tu-PM-16: OFDM |
|
| |
| Wednesday, July 9 |
|
08:30 - 09:30
|
| Claude E. Shannon Award Lecture: Robert M. Gray, Stanford University |
|
|
09:50 - 10:50
|
| Recent Results Poster Session |
|
|
11:00 - 12:40
|
| We-AM-1: Relaying |
|
|
|
| We-AM-2: Cognitive Communication |
|
|
|
| We-AM-3: Sequences for Spread Spectrum |
|
|
|
| We-AM-4: Classic and New Problems |
|
|
|
| We-AM-5: Source Coding Topics |
|
|
|
| We-AM-6: Analysis of Iterative Decoding |
|
|
|
| We-AM-7: Multi-dimensional Constrained Coding |
|
|
|
| We-AM-8: Space-Time Codes: Construction and Performance Bounds |
|
| |
| Thursday, July 10 |
|
08:30 - 09:30
|
| Plenary: Emanuel H. Knill, NIST |
|
|
09:50 - 11:10
|
| Th-AM-1: Decoding by Optimization |
|
|
|
| Th-AM-2: Error Exponents for Multiple Users and Sources |
|
|
|
| Th-AM-3: Multi-terminal Coding |
|
|
|
| Th-AM-4: Balanced Codes and Constrained Coding |
|
|
|
| Th-AM-5: Capacity of Multipath Channels |
|
|
|
| Th-AM-6: Sensor Networks |
|
|
|
| Th-AM-7: New Directions |
|
|
|
| Th-AM-8: Boolean Functions Applied to Cryptography |
|
|
11:30 - 12:50
|
| Th-AM-9: Network Coding: Side Information and Feedback |
|
|
|
| Th-AM-10: Divergence |
|
|
|
| Th-AM-11: Multi-user OFDM Systems |
|
|
|
| Th-AM-12: Broadcast Channels |
|
|
|
| Th-AM-13: Coding for Flash Memories |
|
|
|
| Th-AM-14: Synthesis and Analysis of Sequences |
|
|
|
| Th-AM-15: Reliability and Error Exponents |
|
|
|
| Th-AM-16: Random Matrices |
|
|
14:40 - 16:00
|
| Th-PM-1: MDS Codes |
|
|
|
| Th-PM-2: Network Coding Fundamentals |
|
|
|
| Th-PM-3: Cryptographic Algorithms |
|
|
|
| Th-PM-4: Detection and Estimation |
|
|
|
| Th-PM-5: Turbo Codes |
|
|
|
| Th-PM-6: MIMO Relaying |
|
|
|
| Th-PM-7: Sequence Constructions |
|
|
|
| Th-PM-8: Redundancy |
|
|
16:20 - 18:00
|
| Th-PM-9: Code Construction and Analysis |
|
|
|
| Th-PM-10: Lossy Source Coding Topics |
|
|
|
| Th-PM-11: Detection in MIMO Systems |
|
|
|
| Th-PM-12: QoS and Fairness |
|
|
|
| Th-PM-13: Rateless Codes I |
|
|
|
| Th-PM-14: Relaying and Cooperation I |
|
|
|
| Th-PM-15: Entropies and Information Inequalities |
|
|
|
| Th-PM-16: Pattern Recognition and Learning |
|
| |
| Friday, July 11 |
|
08:30 - 09:30
|
| Plenary: Avi Wigderson, Institute for Advanced Study |
|
|
09:50 - 11:10
|
| Fr-AM-1: Channel Coding |
|
|
|
| Fr-AM-2: Lossy Source Coding with Side Information |
|
|
|
| Fr-AM-3: Compressed Sensing |
|
|
|
| Fr-AM-4: Secrecy with Broadcast and Relays |
|
|
|
| Fr-AM-5: Unequal Error Protection |
|
|
|
| Fr-AM-6: Rateless Codes II |
|
|
|
| Fr-AM-7: Relaying and Cooperation II |
|
|
|
| Fr-AM-8: Genes and Biometrics |
|
|
11:30 - 12:50
|
| Fr-AM-9: Source Coding and Networks |
|
|
|
| Fr-AM-10: Coded Modulation |
|
|
|
| Fr-AM-11: Computation I |
|
|
|
| Fr-AM-12: Diversity-Multiplexing Tradeoff |
|
|
|
| Fr-AM-13: Coding for Relay Channels |
|
|
|
| Fr-AM-14: Linear Complexity of Sequences |
|
|
|
| Fr-AM-15: Capacity of Wireless Channels |
|
|
|
| Fr-AM-16: Signal Recovery/Optimization |
|
|
14:40 - 16:00
|
| Fr-PM-1: Lossless Source Coding |
|
|
|
| Fr-PM-2: Codes and Lattices |
|
|
|
| Fr-PM-3: Computation II |
|
|
|
| Fr-PM-4: Multi-user Games |
|
|
|
| Fr-PM-5: Distributed Space-Time Coding |
|
|
|
| Fr-PM-6: Precoding and Beamforming |
|
|
|
| Fr-PM-7: Capacity of MIMO Channels |
|
|
|
| Fr-PM-8: Correlation of Sequences |
|
|
16:20 - 17:40
|
| Fr-PM-9: Topics in Algebraic Coding Theory |
|
|
|
| Fr-PM-10: Entropy |
|
|
|
| Fr-PM-11: MIMO II |
|
|
|
| Fr-PM-12: New Relaying Strategies |
|
|
|
| Fr-PM-13: Multiaccess Channels |
|
|
|
| Fr-PM-14: Quantization |
|
|
|
| Fr-PM-15: Modulation |
|
|
|
| Fr-PM-16: Quaternary Sequences |
|
