A Gilbert-Varshamov bound for quasi-cycle codes of rate 1/2 (Corresp.)

1 September 1974

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory

Vol. 20 (5) , 679
https://doi.org/10.1109/tit.1974.1055262

Abstract

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].

Keywords

CYCLIC CODES

This publication has 1 reference indexed in Scilit:

Some results on quasi-cyclic codes
Information and Control, 1969