Information Theory and Network Coding (Instructor Solution Manual, Solutions)

✍ Scribed by Raymond W. Yeung

• Publisher: Springer
• Year: 2008
• Tongue: English
• Leaves: 234
• Series: Information Technology: Transmission, Processing and Storage
• Edition: 1
• Category: Library

✦ Table of Contents

Chapter 2: Information Measures
2.1
2.2
2.3
2.4
2.5
2.6
2.7
2.8
2.9
2.9(a)
2.9(b)
2.10
2.10(a)
2.10(b)
2.11
2.12
2.12(a)
2.12(b)
2.13
2.14
2.15
2.16
2.17
2.18
2.19
2.20
2.21
2.22
2.23
2.23(a)
2.23(b)
2.23(c)
2.24
2.25
2.26
2.27
2.28
2.28(a)
2.28(b)
2.29
2.29(a)
2.29(b)
2.30
2.30(a)
2.30(b)
2.31
2.32
2.32(a)
2.32(b)
2.32(c)
Chapter 3: The I-Measure
3.1
3.2
3.3
3.3(a)
3.3(b)
3.4
3.4(a)
3.4(b)
3.5
3.5(a)
3.5(b)
3.6
3.6(a)
3.6(b)
3.7
3.7(a)
3.7(b)
3.8
3.9
3.9(a)
3.9(b)
3.10
3.10(a)
3.10(b)
3.11
3.11(a)
3.11(b)
3.12
3.12(a)
3.12(b)
3.13
3.13(a)
3.13(b)
3.13(c)
3.13(d)
3.13(e)
3.13(f)
3.14
3.15
Chapter 4: Zero-Error Data Compression
4.1
4.2
4.3
4.4
4.5
4.6
4.7
4.8
4.9
4.9(a)
4.9(b)
4.10
4.10(a)
4.10(b)
4.10(c)
Chapter 5: Weak Typicality
5.1
5.2
5.3
5.4
5.5
5.5(a)
5.5(b)
5.5(c)
5.6
5.7
5.8
5.8(a)
5.8(b)
5.9
5.9(a)
5.9(b)
5.9(c)
5.10
Chapter 6: Strong Typicality
6.1
6.2
6.3
6.4
6.4(a)
6.4(b)
6.4(c)
6.5
6.6
6.7
6.8
6.9
6.9(a)
6.9(b)
6.10
6.10(a)
6.10(b)
6.10(c)
6.10(d)
6.10(e)
6.11
Chapter 7: Discrete Memoryless Channel
7.1
7.1(a)
7.1(b)
7.2
7.3
7.3(a)
7.3(b)
7.3(c)
7.4
7.4(a)
7.4(b)
7.5
7.6
7.7
7.7(a)
7.7(b)
7.7(c)
7.7(d)
7.8
7.8(a)
7.8(b)
7.9
7.10
7.11
7.11(a)
7.11(b)
7.11(c)
7.12
7.12(a)
7.12(b)
7.13
7.13(a)
7.13(b)
7.13(c)
7.13(d)
7.13(e)
7.14
7.14(a)
7.14(b)
7.15
7.16
7.16(a)
7.16(b)
7.17
7.18
Chapter 8: Rate-Distortion Theory
8.1
8.2
8.2(a)
8.2(b)
8.3
8.3(a)
8.3(b)
8.4
8.5
8.6
8.7
Chapter 9: The Blahut-Arimoto Algorithms
9.3
9.4
9.5
9.5(a)
9.5(b)
Chapter 10: Differential Entropy
10.1
10.2
10.3
10.4
10.5
10.5(a)
10.5(b)
10.5(c)
10.6
10.7
10.8
10.9
10.10
10.11
10.12
10.13
Chapter 11: Differential Entropy
11.1
11.2
11.3
11.4
11.5
11.6
11.6(a)
11.6(b)
11.7
11.8
11.9
11.9(a)
11.9(b)
11.9(c)
11.10
11.11
Chapter 12: Markov Structures
12.1
12.2
12.3
12.4
12.4(a)
12.4(b)
12.5
12.6
12.6(a)
12.6(b)
12.7
Chapter 13: Information Inequalities
13.1
13.2
13.3
13.3(a)
13.3(b)
13.4
13.4(a)
13.4(b)
13.5
Chapter 14: Shannon-Type Inequalities
14.1
14.2
14.3
14.4
14.5
14.5(a)
14.5(b)
14.5(c)
14.6
14.7
14.8
14.9
14.10
Chapter 15: Beyond Shannon-Type Inequalities
15.1
15.2
15.3
15.4
15.5
15.6
15.6(a)
15.6(b)
15.7
15.7(a)
15.7(b)
15.7(c)
15.7(d)
Chapter 16: Entropy and Groups
16.1
16.2
16.2(a)
16.2(b)
16.3
16.4
16.5
16.6
16.6(a)
16.6(b)
16.7
16.8
16.9
16.9(a)
16.9(b)
16.9(c)
16.9(d)
16.9(e)
16.9(f)
16.9(g)
Chapter 17: Fundamentals of Network Coding – Introduction
17.1
17.1(a)
17.1(b)
17.1(c)
17.1(d)
17.1(e)
17.2
17.3
Chapter 18: The Max-Flow Bound
18.1
18.2
18.3
18.4
18.5
18.5(a)
18.5(b)
18.5(c)
18.6
18.6(a)
18.6(b)
18.6(c)
18.6(d)
Chapter 19: Single-Source Linear Network Coding: Acyclic Networks
19.1
19.2
19.3
19.3(a)
19.3(b)
19.4
19.5
19.6
19.7
19.8
19.9
19.10
19.11
19.12
19.13
19.14
19.15
19.16
19.16(a)
19.16(b)
19.17
19.18
19.18(a)
19.18(b)
Chapter 20: Single-Source Linear Network Coding: Cyclic Networks
20.1
20.2
20.3
20.4
20.5
Chapter 21: Multi-Source Network Coding
21.1
21.2
21.2(a)
21.2(b)
21.3
21.3(a)
21.3(b)
21.3(c)
21.4
21.4(a)
21.4(b)
21.4(c)
21.5
21.5(a)
21.5(b)
21.5(c)
21.5(d)
21.5(e)
21.5(f)
21.5(g)
21.6
21.7
21.8