User Tools

Site Tools


Writing /home/users/ashutosn/public_html/CommNetS2016/dokuwiki/data/cache/6/66a54308a092fe72908db3cc16372cc0.i failed
Unable to save cache file. Hint: disk full; file permissions; safe_mode setting.
Writing /home/users/ashutosn/public_html/CommNetS2016/dokuwiki/data/cache/6/66a54308a092fe72908db3cc16372cc0.metadata failed
channel_coding_non_asymptotic_fundamental_limits_with_and_without_feedback
Writing /home/users/ashutosn/public_html/CommNetS2016/dokuwiki/data/cache/4/4c47e099ad93cfdd49da21f4cec5aad6.i failed
Unable to save cache file. Hint: disk full; file permissions; safe_mode setting.
Writing /home/users/ashutosn/public_html/CommNetS2016/dokuwiki/data/cache/4/4c47e099ad93cfdd49da21f4cec5aad6.xhtml failed

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

channel_coding_non_asymptotic_fundamental_limits_with_and_without_feedback [2016/09/01 19:15] (current)
Line 1: Line 1:
 +=== Channel coding: non asymptotic fundamental limits with and without
 +feedback===
  
 +Yury Polyanskiy
 +Feb 23, 2:​00pm ​
 +EEB 248. 
 +
 +
 +**Abstract:​** ​
 +Information theory studies the question of the maximum possible rate
 +achievable by an ideal system under certain assumptions regarding the noise generation ​
 +and structural design constraints. The study of such questions, initiated by Claude Shannon in 1948, has
 +typically been carried out in the asymptotic limit of an infinite number of signaling
 +degrees of freedom (blocklength). However, with the ever increasing demand for ubiquitous access to real time 
 +data, such as audio and video streaming for mobile devices, as well as the advent of modern sparse graph codes, one is
 +interested in describing fundamental limits non-asymptotically,​ i.e. for blocklengths of the
 +order of 1000. By employing some of our recently developed methods it will be demonstrated that for such blocklengths the backoff from the capacity can be quite significant. On the other hand, this penalty is significantly mitigated by employing variable-length codes with feedback.
 +
 +**Biography:​**
 +Yury Polyanskiy received the M.S. degree (with honors)
 +in applied mathematics and physics from the Moscow Institute of Physics and
 +Technology, Moscow, Russia in 2005 and the Ph.D.
 +degree in electrical engineering from Princeton University, Princeton, NJ in 2010.
 +
 +In 2000-2005, he was with the Department of Surface Oilfield Equipment,
 +Borets Company LLC, where he rose to the position of Chief Software Designer.
 +His research interests include information theory, coding theory and the theory
 +of random processes.
 +
 +Dr. Polyanskiy won a silver medal at the 30th International Physics Olympiad (IPhO), held in
 +Padova, Italy. He was a recipient of the
 +Best Student Paper Awards at the 2008 and 2010
 +IEEE International Symposia on Information Theory (ISIT). His final year of
 +graduate studies was supported by a Princeton University Honorific Dodds Fellowship (2009-2010).
 +
 +Host: Alex Dimakis, dimakis [at] usc.edu
 +
 +Back to [[start | CommNetS Seminar Page ]]
channel_coding_non_asymptotic_fundamental_limits_with_and_without_feedback.txt ยท Last modified: 2016/09/01 19:15 (external edit)