A Gilbert-Varshamov bound for quasi-cycle codes of rate 1/2 (Corresp.)
Tadao Kasami · IEEE Transactions on Information Theory · 1974
It is shown that there exist arbitrarily long quasi-cyclic(2k,k)binary codes that meet a bound slightly weaker than the Gilbert-Varshamov bound. This is a refinement of the result of Chen, Peterson, and Weldon [1].