The Gilbert--Varshamov (GV) bound is a classical existential result in coding theory. It implies that a random linear binary code of rate $\epsilon^2$ has relative distance at least $\frac{1}{2} - O(\epsilon)$ with high probability. However, it is a major challenge to construct explicit codes with similar parameters. One hope to derandomize the Gilbert--Varshamov construction is with code concatenation: We begin with a (hopefully explicit) outer code ${C}_\mathrm{out}$ over a large alphabet, and concatenate that with a small binary random linear code ${C}_\mathrm{in}$. It is known that when we use \emph{independent} small codes for each coordinate, then the result lies on the GV bound with high probability, but this still uses a lot of randomness. In this paper, we consider the question of whether code concatenation with a single random linear inner code ${C}_\mathrm{in}$ can lie on the GV bound; and if so what conditions on ${C}_\mathrm{out}$ are sufficient for this. We show that first, there do exist linear outer codes ${C}_\mathrm{out}$ that are "good" for concatenation in this sense (in fact, most linear codes codes are good). We also provide two sufficient conditions for ${C}_\mathrm{out}$, so that if ${C}_\mathrm{out}$ satisfies these, ${C}_\mathrm{out}\circ {C}_\mathrm{in}$ will likely lie on the GV bound. We hope that these conditions may inspire future work towards constructing explicit codes ${C}_\mathrm{out}$.

翻译：Gilbert-Varshamov（GV）界是编码理论中的一个经典存在性结果。该结果表明，速率为$\epsilon^2$的随机线性二元码以高概率具有至少$\frac{1}{2} - O(\epsilon)$的相对距离。然而，构造具有类似参数的显式码是一项重大挑战。去随机化Gilbert-Varshamov构造的一种希望是采用码级联方法：我们从一个（希望是显式的）大字母表上的外码${C}_\mathrm{out}$出发，将其与一个小型二元随机线性内码${C}_\mathrm{in}$进行级联。已知当对每个坐标使用\textit{独立}的小码时，结果以高概率位于GV界上，但这仍然需要大量随机性。本文研究的问题是：使用单一随机线性内码${C}_\mathrm{in}$的级联码能否位于GV界上？若能，外码${C}_\mathrm{out}$需要满足哪些充分条件？我们首先证明，确实存在在此意义上"良好"的线性外码${C}_\mathrm{out}$用于级联（事实上，大多数线性码都是良好的）。我们还给出了${C}_\mathrm{out}$的两个充分条件，使得若${C}_\mathrm{out}$满足这些条件，则${C}_\mathrm{out}\circ {C}_\mathrm{in}$很可能位于GV界上。我们希望这些条件能启发未来构造显式外码${C}_\mathrm{out}$的相关研究。