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].
No takes yet. Share an insight, caveat, or question.
Tadao Kasami (1974) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: