På Svenska

EO3300 Multiuser Information Theory 8.0 credits

Informationsteori för fleranvändarkanaler

The course provides a rigorous introduction to some of the most fundamental results in multi-user information theory assuming finite alphabet sets. Advanced information theoretic techniques, random coding and converse proof methods, and a basic computational algorithm used in information theory should be learned. General scientific and problem solving skills in advanced information theory should be trained.

  • Educational level

    Third cycle

  • Academic level (A-D)

    D

  • Subject area

  • Grade scale

Information for research students about course offerings

Will be given late spring 2012

Learning outcomes

After the course the student should be able to

1.     discuss and review recent advances on classical results on multi-user information theory,

2.     apply the conceptual proof techniques to solve information-theoretic multi-user problems,

3.     generalize and apply fundamental coding and outer bound methods to solve information-theoretic multi-user problems,

4.     apply and transfer basic skills for solving frequently arising side problems in information theory.

Course main content

Typical Sequences, Multiple access channel, Cut-set bound, Gel’fand Pinsker coding, Wyner-Ziv coding, Broadcast channel, Relay channel, Bounding cardinality, Fourier-Motzkin method, Arimoto-Blahut algorithm, Feedback channel

Disposition

Lecture, homework problems, short essays, peer assessments, presentation or review of a selected paper

Eligibility

Required prerequisite for this course is the basic course on information theory EQ2840/F2EO3210 “Information Theory”

Prerequisites

 Required prerequisite for this course is the basic course on information theory EQ2840/F2EO3210 “Information Theory”

Literature

·        Lecture Notes on Network Information Theoryby A. El Gamal and Y.-H. Kim (available under arXiv:1001.3404v1).

·        Information Theory and Network Codingby R. Yeung.

Complementary literature

·        Topics in Multi-User Information Theoryby G. Kramer, 2007 (NOW Foundations and Trends in Communications and Information Theory).

·        Elements of Information Theoryby T. Cover and J. Thomas.

·        Coding theorems for discrete memoryless channelsby I. Csiszár and J. Körner.

Examination

Requirements for final grade

To pass the course the student

·        has to hand in every homework and do peer assessment for each. For each homework a minimum number of points must be achieved as well as the sum of all achieved points has to exceed a threshold, and

·        has to do a review of a pre-print work published on ArXiv or give a 15-30 min oral presentation of a published Trans IT paper.

Offered by

EES/Communication Theory

Contact

Tobias Oechtering

Examiner

Tobias Oechtering <oech@kth.se>

Supplementary information

Fits toInformations- och kommunikationsteknologi (ICT) track

Version

Course plan valid from: Spring 12.