I. Introduction
Random linear codes (RLCs) are ubiquitous in coding theory, serving as a fundamental building block in the construction of codes since the works of Shannon. RLCs are extensively studied, and known to enjoy excellent combinatorial properties. In particular, they achieve Shannon capacity, the Gilbert-Varshamov rate vs. distance trade-off, and are list-decodable up to capacity.