We first apply the Unrestricted Johnson Bound [1]}, [2]} to a CWC with parameters \(S_{\text{cw}}\) , \(W_{\text{cw}}\) , and \(d_{\text{cw}}\) , which can be proved by recursively puncturing codewords. Then, by using Lemma REF , the theorem follows.
