1 Introduction and Setup

This blueprint formalises the paper of Doron, Mosheiff and Wootters on when a low-rate concatenated code \(\mathcal{C}= \mathcal{C}_{\mathrm{out}}\circ \mathcal{C}_{\mathrm{in}}\), built from a fixed (or random) inner code \(\mathcal{C}_{\mathrm{in}}\) and an outer code \(\mathcal{C}_{\mathrm{out}}\), attains the Gilbert–Varshamov (GV) bound. The central objects are linear codes over finite fields, their dual codes, Hamming weight, the binary entropy function, and a Fourier-analytic moment method.

We collect the basic definitions in Chapter 2, set up the moment framework in Chapter 3, and then prove the three main results: that most outer codes work (Chapter 4, Theorem 4.2), a soft-decoding sufficient condition (Chapter 5, Theorem 5.1), and a min-entropy sufficient condition (Chapter 6, Theorem 6.2).