2017 IEEE International Symposium on Information Theory

Aachen, Germany | June 25-30, 2017

ISIT 2017

The IEEE International Symposium on Information Theory (ISIT) will take place in the historic city of Aachen, Germany, from June 25 to 30, 2017. With 800 international experts, scientists and researchers expected, ISIT focuses on the processing, transmission, storage, and use of information. It specifically encompasses theoretical and certain applied aspects of coding, communications and communications networks, complexity and cryptography, detection and estimation, and learning.

The range of topics related to information theory includes, but is not limited to the following areas: Big Data Analytics, Coding for Communication and Storage, Coding Theory, Communication Theory, Complexity and Computation Theory, Compressed Sensing and Sparsity, Cryptography and Security, Detection and Estimation, Emerging Applications of IT, Information Theory and Statistics, Information Theory in Biology, Network Coding and Applications, Network Information Theory, Optical Communication, Pattern Recognition and Machine Learning, Physical Layer Security, Quantum Information and Coding Theory, Shannon Theory, Signal Processing, Source Coding and Data Compression, Wireless Communication and Networks.

The IEEE ISIT is a place for networking and a think tank for new ideas. By contributing to this conference you will be able to draw the attention of key players in this field from around the world. The range of use cases is broad. Network operators and developers are equally addressed. Companies and institutions which provide services for the “smart market” often use solutions based on Information Theory. We look forward to welcoming you to the world of Information Theory in Aachen!

Prof. Dr. Rudolf Mathar

RWTH Aachen University

Register now!

Support request

Upcoming Dates

Recent Results Submission Deadline

April 30, 2017

Early Bird Registrations

May 2, 2017

Camera Ready Version

May 7, 2017


June 25-30, 2017 in Aachen, Germany