The Department of Mathematical Sciences and the Holcombe Department of Electrical and Computer Engineering of Clemson University have the pleasure of inviting you to the event

Shannon Centennial at Clemson

that will take place on Friday December 2 at 3:30pm in EIB 132 (Fluor Daniel Engineering Innovation Building).

The speakers will be 

Emina Soljanin, Rutgers University


Users of cloud systems demand that their data be reliably stored and quickly accessible. Cloud providers today strive to meet these demands through over-provisioning: keeping processors ready to go at all times and replicating data over multiple servers. Special erasure codes have been designed and adopted in practice as a more storage-efficient way to provide reliability. We will show how coding reduces download time of large files, in addition to providing reliability against disk failures. For the same total storage used, coding exploits the diversity and parallelism in the system better than today's replication schemes, and hence gives faster download. We will introduce a fork-join queuing framework to model multiple users requesting their data simultaneously, and demonstrate the trade-off between the download time and the amount of storage space. At the end, we will mention several problems that arise in distributed systems when the stored data is large, changing, and expanding.

Frank R. Kschischang, University of Toronto


Using ideas from compute-and-forward relaying and lattice coding, we show how wireless fading and interference can be turned from a "bug" to a "feature", yielding an end-to-end physical-layer network coding channel. (Joint work with Chen Feng and Danilo Silva.)

This event in mainly financed by the IEEE Information Theory Society and is part of the Shannon Centenary events. 
Other sponsors are the Holcombe Department of Electrical and Computer Engineering and the NSF RTG grant on Coding Theory, Cryptography, and Number Theory.