DocumentCode
922091
Title
A Gilbert-Varshamov bound for quasi-cycle codes of rate 1/2 (Corresp.)
Author
Kasami, T.
Volume
20
Issue
5
fYear
1974
fDate
9/1/1974 12:00:00 AM
Firstpage
679
Lastpage
679
Abstract
It is shown that there exist arbitrarily long quasi-cyclic
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].
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; Binary codes; Error correction codes; Notice of Violation; Polynomials; Radiofrequency interference; Terminology; Welding;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1974.1055262
Filename
1055262
Link To Document