Tutorial Lecturers
Prof. Dr.-Ing. Stephan ten Brink
Institute of Telecommunications, University of Stuttgart
Ìý
|
|
ÌýÌýÌýÌý |
The course is structured as follows:
- how it all began: the LDPC codes and serially concatenated codes of the 1960s; - re-discovery and innovation: extrinsic information and parallel concatenated codes of the early 1990s; - design of concatenated coding schemes with the EXIT chart; - iterative detection and decoding; - new trends: polar codes and spatially coupled codes . Ìý
Ìý
Ìý
Ìý
|
|---|
Biography
Stephan ten Brink joined the Institute of Telecommunications in July 2013. Prior to his assignment at the University of Stuttgart, he worked in various positions in industry, research and development.
Prior assignments include
- one year researcher at Bell Laboratories, Lucent Technologies in Swindon, U.K. (mobile wireless communications, GSM, UMTS)
- 5 years as researcher at Bell Laboratories in Holmdel, New Jersey, U.S.A. (channel coding and signal detection for multiple antenna communications)
- 7 years at Realtek Semiconductor Corp. in Irvine, California, U.S.A., as director of wireless ASIC development (WLAN, UWB baseband)
- 3 years at Bell Laboratories, Alcatel-Lucent in Stuttgart, Germany, as department head in wireless physical layer research (signal processing and channel coding for wireless and optical communication systems; LTE, long-haul)
The common theme across his appointments is in digital modem design, particularly signal processing and channel coding for communications, for improving data rate, receiver sensitivity, and power efficiency.
He is member of the VDE/ITG, and Senior Member of the ¿Û¿Û´«Ã½ Communications and Information Theory Society.
He is member of the VDE/ITG, and Senior Member of the ¿Û¿Û´«Ã½ Communications and Information Theory Society.
In October 2013, he was elected to the Board of Governors of the ¿Û¿Û´«Ã½ Information Theory Society.
Prof. Imre Csiszár
Alfréd Rényi Mathematical Institute of the Hungarian Academy of Sciences
Ìý
|
|
ÌýÌýÌýÌý |
Contemporary techniques of data security are primarily based on computational complexity, typically on the infeasibility of inverting certain functions via currently available mathematical tools and computing power. Future progress, for example quantum computers, may render these techniques insecure.
Information theoretic secrecy offers provable security even against adversaries of unlimited computational power. It requires some kind of correlated randomness available toÌý the legal parties, and offers tools to use this resource to achieve perfect secrecy from an adversary who may have some but not complete information about this randomness.
In these lectures, two of the main subjects of information theoretic secrecy will be addressed: Secure communication over an insecure channel, and generating a common secret key for two or more parties relying upon public communication. Attention will be restricted to models requiring secrecy against a passive adversary who listens to the legal parties’ communication but does not interfere with it.
Starting with basic prerequisites, a state-of-the art insight will be given into the mentioned subjects. The emphasis will be on fundamental limits, i.e., on optimal performance theoretically achievable. Some applications will also be mentioned.
|
|---|