Source coding, channel coding. Optimal codes.
graph TD
D1["Def: Source code\nenc: X^n→{0,1}*"]
D2["Def: Channel code\nenc, dec, rate R"]
D3["Def: Block error\nP_e = P(dec(Y)≠X)"]
D4["Def: Rate R\nbits/channel use"]
T1["Thm: Source coding\nR≥H(X) for lossless"]
T2["Thm: Channel coding\nR D2
D2 --> D3
D3 --> T1
T1 --> T2
T2 --> T4
classDef definition fill:#b197fc,color:#fff
classDef theorem fill:#51cf66,color:#fff
class D1,D2,D3,D4 definition
class T1,T2,T3,T4,T5 theorem
Process Statistics
- Nodes: 14
- Edges: 11
Frontier: math.IT