The generalized Gilbert-Varshamov bound is implied by Turán's theorem

IEEE Transactions on Information Theory

Volumn 43, Issue 5, 1997, Pages 1605-1606

  Tolhuizen, Ludo M G M ^a,b  

^a IEEE   (Netherlands)

^b PHILIPS RESEARCH LABORATORIES   (Netherlands)

Author keywords

Clique; Gilbert Varshamov bound; Graph; Runlength constraints; Tur n's theorem

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; GRAPH THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING; THEOREM PROVING;

CLIQUE; GILBERT-VARSHAMOV BOUND; RUNLENGTH CONSTRAINTS; TURAN THEOREM;

CODES (SYMBOLS);

EID: 0031233346     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.623158     Document Type: Article

References (9)

1. J. H. van Lint, Introduction to Coding Theory (Graduate Texts in Mathematics). Berlin, Germany: Springer, 1981.
2. J. Gu and T. Fuja, "A generalized Gilbert-Varshamov bound derived via analysis of a code-search algorithm," IEEE Trans. Inform. Theory, vol. 39, pp. 1089-1093, May 1993.
3. V. D. Kolesnik and V. Y. Krachovsky, "Generating functions and lower bounds on rates for limited error-correcting codes," IEEE Trans. Inform. Theory, vol. 37, pp. 778-788, May 1991.
4. J. H. van Lint and R. M. Wilson, A Course in Combinatorics. Cambridge, U.K.: Cambridge Univ. Press, 1992.
5. T. Kasami, S. Lin, V. K. Wei, and S. Yamamura, "Graph theoretic approaches to code construction for the two-user multiple-access binary adder channel," IEEE Trans. Inform. Theory, vol. IT-29, pp. 114-130, Jan. 1983.
6. B. Bollobás, "Extremal graph theory," in Handbook of Combinatorics, vol. 2, R. Graham, M. Grötschel, and L. Lovász, Eds. Amsterdam, The Netherlands: Elsevier, 1995, ch. 23, pp. 1233-1280.
7. Ø. Ytrehus, "Codes for error control," Dr.Sc. dissertation, Univ. of Bergen, Bergen, Norway, June 1989.
8. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
9. T. A. Feo, M. G. C. Resende, and S. H. Smith, "A greedy randomized adaptive search procedure for maximum independent set," Oper. Res., vol. 42, no. 5, pp. 860-878, Sept.-Oct. 1994.