Systematic Codes Correcting Two Deletions with Three Redundant Symbols over Large Alphabets

A literal-systematic $q$-ary code leaves its $n$ information symbols unchanged and appends deletion-prone checks. For $n\ge2$, a known lower bound requires three such checks to correct two arbitrary deletions. We give a uniform construction meeting this minimum over a power-of-two alphabet $q<2^{32}