Prerequisites & Notation

Before You Begin

Interference alignment over finite fields is the last "tool" chapter of Part I before Part II's coded-computing constructions. The prerequisites are linear algebra over $\mathbb{F}_q$ , comfort with the language of degrees-of-freedom, and the secret-sharing background of Chapter 3. Readers who have skipped the IA literature in the wireless ITA book will find the discrete setting both cleaner and more directly applicable to the algebraic problems of distributed computing.

Linear algebra over finite fields $\mathbb{F}_q$ (Review ch03)
Self-check: For $\mathbf{A} \in \mathbb{F}_q^{m \times n}$ , what is the relationship between $\text{rank}(\mathbf{A})$ , $\dim(\text{null}(\mathbf{A}))$ , and $n$ ?
Vector subspaces, intersections, and direct sums
Self-check: For subspaces $U, V \subseteq \mathbb{F}_q^n$ , when is $U + V = U \oplus V$ ?
Degrees-of-freedom (DoF) intuition for multi-user channels(Review ch17)
Self-check: In the $K$ -user interference channel, how many DoF can each user achieve in the high-SNR limit?
Discrete memoryless channels and capacity(Review ch09)
Self-check: Can you state the capacity of a noiseless $q$ -ary symmetric channel?
Chapter 2's distributed-computing framework(Review ch02)
Self-check: Can you state the optimal $(\mu, \Delta)$ tradeoff?

Notation for This Chapter

IA-specific notation. We work over a fixed prime power $q$ and use $K$ for the number of interfering users (matching the interference-channel literature). When $K$ later refers to the recovery threshold of coded matrix multiplication (Chapter 5), we will use $K_{\text{IC}}$ to disambiguate. The same caveat applies to $N$ — here it is the per-user signal dimension.

Symbol	Meaning	Introduced
$\mathbb{F}_q$	Finite field over which IA is performed (typically $q$ prime power)	s01
$K_{\text{IC}}$	Number of interfering transmitter–receiver pairs	s01
$\mathbf{V}_k$	Beamforming (precoding) matrix used by transmitter $k$	s01
$\mathbf{U}_k$	Receive-side projection (interference-cancelling) matrix at receiver $k$	s01
$d_k$	Number of degrees of freedom (DoF) achieved by user $k$	s01
$\mathbf{H}_{kj}$	Cross-channel matrix from transmitter $j$ to receiver $k$	s01
$M$	Per-user cache size (in number of files), Section 4.3	s03
$F$	Number of files in the library (coded caching) or files in PIR	s03
$T$	PIR collusion threshold (Section 4.4)	s04

← Ch 3 Interference Alignment in Finite Fields