메뉴 건너뛰기




Volumn 8, Issue 4, 1998, Pages 1265-1270

Intelligent search for 2 13-6 and 2 14-7 minimum aberration designs

Author keywords

Defining contrast subgroup; Fractional factorial design; Wordlength pattern

Indexed keywords


EID: 0032268167     PISSN: 10170405     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (11)

References (10)
  • 2
    • 0030343879 scopus 로고    scopus 로고
    • n-1 designs with weak minimum aberration
    • n-1 designs with weak minimum aberration. Ann. Statist. 24, 2536-2548.
    • (1996) Ann. Statist. , vol.24 , pp. 2536-2548
    • Chen, H.1    Hedayat, A.S.2
  • 3
    • 21144460457 scopus 로고
    • n-k fractional factorial designs and search for minimum aberration designs
    • n-k fractional factorial designs and search for minimum aberration designs. Ann. Statist. 20, 2124-2141.
    • (1992) Ann. Statist. , vol.20 , pp. 2124-2141
    • Chen, J.1
  • 5
    • 21344495645 scopus 로고
    • A catalogue of two-level and three-level fractional factorial designs with small runs
    • Chen, J., Sun, D. X. and Wu, C. F. J. (1993). A catalogue of two-level and three-level fractional factorial designs with small runs. Int. Statist. Rev. 61, 131-145.
    • (1993) Int. Statist. Rev. , vol.61 , pp. 131-145
    • Chen, J.1    Sun, D.X.2    Wu, C.F.J.3
  • 6
    • 0000823962 scopus 로고
    • n-k fractional factorial designs with minimum aberration or optimal moments
    • n-k fractional factorial designs with minimum aberration or optimal moments. Ann. Statist. 19, 1028-1041.
    • (1991) Ann. Statist. , vol.19 , pp. 1028-1041
    • Chen, J.1    Wu, C.F.J.2
  • 9
    • 0030335135 scopus 로고    scopus 로고
    • n-k designs in terms of their complementary designs
    • n-k designs in terms of their complementary designs. Ann. Statist. 24, 2549-2559.
    • (1996) Ann. Statist. , vol.24 , pp. 2549-2559
    • Tang, B.1    Wu, C.F.J.2
  • 10
    • 0023415923 scopus 로고
    • An updated table of minimum-distance bounds for binary linear codes
    • Verhoeff, T. (1987). An updated table of minimum-distance bounds for binary linear codes. IEEE Trans. Inform. Theory 33, 665-680.
    • (1987) IEEE Trans. Inform. Theory , vol.33 , pp. 665-680
    • Verhoeff, T.1


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