2013-2014 2014-2015 2015-2016 2016-2017 2017-2018
Browse
by subject...
    Schedule
view...
 

1 - 1 of 1 results for: EE 376B: Network Information Theory

EE 376B: Network Information Theory (STATS 376B)

Network information theory deals with the fundamental limits on information flow in networks and the optimal coding schemes that achieve these limits. It aims to extend Shannon's point-to-point information theory and the Ford-Fulkerson max-flow min-cut theorem to networks with multiple sources and destinations. The course presents the basic results and tools in the field in a simple and unified manner. Topics covered include: multiple access channels, broadcast channels, interference channels, channels with state, distributed source coding, multiple description coding, network coding, relay channels, interactive communication, and noisy network coding. Prerequisites: EE376A.
Terms: not given this year | Units: 3 | Grading: Letter or Credit/No Credit
Instructors: El Gamal, A. (PI)
Filter Results:
term offered
updating results...
number of units
updating results...
time offered
updating results...
days
updating results...
UG Requirements (GERs)
updating results...
component
updating results...
career
updating results...
© Stanford University | Terms of Use | Copyright Complaints