Chapter 14: Finite Packetization and Practical Considerations

Learning Objectives

• Understand the subpacketization bottleneck: MAN requires $\binom{K}{t}$ subfiles per file, exponential in $K$
• Define Placement Delivery Arrays (PDAs) as a combinatorial framework for coded caching
• Analyze polynomial-subpacketization schemes based on combinatorial designs
• Present the graph-coloring delivery schemes (CommIT contribution) for finite-size coded caching
• Quantify the tradeoff between subpacketization reduction and rate penalty
• Connect PDA construction to index coding (Ch 4)