메뉴 건너뛰기




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

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

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;

EID: 0031233346     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.623158     Document Type: Article
Times cited : (51)

References (9)
  • 1
    • 0004089464 scopus 로고
    • Graduate Texts in Mathematics. Berlin, Germany: Springer
    • J. H. van Lint, Introduction to Coding Theory (Graduate Texts in Mathematics). Berlin, Germany: Springer, 1981.
    • (1981) Introduction to Coding Theory
    • Van Lint, J.H.1
  • 2
    • 0027601907 scopus 로고
    • A generalized Gilbert-Varshamov bound derived via analysis of a code-search algorithm
    • May
    • 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.
    • (1993) IEEE Trans. Inform. Theory , vol.39 , pp. 1089-1093
    • Gu, J.1    Fuja, T.2
  • 3
    • 0026157966 scopus 로고
    • Generating functions and lower bounds on rates for limited error-correcting codes
    • May
    • 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.
    • (1991) IEEE Trans. Inform. Theory , vol.37 , pp. 778-788
    • Kolesnik, V.D.1    Krachovsky, V.Y.2
  • 5
    • 0020587839 scopus 로고
    • Graph theoretic approaches to code construction for the two-user multiple-access binary adder channel
    • Jan.
    • 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.
    • (1983) IEEE Trans. Inform. Theory , vol.IT-29 , pp. 114-130
    • Kasami, T.1    Lin, S.2    Wei, V.K.3    Yamamura, S.4
  • 6
    • 0000941223 scopus 로고
    • Extremal graph theory
    • R. Graham, M. Grötschel, and L. Lovász, Eds. Amsterdam, The Netherlands: Elsevier, ch. 23
    • 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.
    • (1995) Handbook of Combinatorics , vol.2 , pp. 1233-1280
    • Bollobás, B.1
  • 7
    • 3943060765 scopus 로고
    • Dr.Sc. dissertation, Univ. of Bergen, Bergen, Norway, June
    • Ø. Ytrehus, "Codes for error control," Dr.Sc. dissertation, Univ. of Bergen, Bergen, Norway, June 1989.
    • (1989) Codes for Error Control
    • Ytrehus, Ø.1
  • 9
    • 0028510982 scopus 로고
    • A greedy randomized adaptive search procedure for maximum independent set
    • Sept.-Oct.
    • 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.
    • (1994) Oper. Res. , vol.42 , Issue.5 , pp. 860-878
    • Feo, T.A.1    Resende, M.G.C.2    Smith, S.H.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.