메뉴 건너뛰기




Volumn 14, Issue 3, 2006, Pages 202-213

Covering arrays of higher strength from permutation vectors

Author keywords

Covering array; Orthogonal array; Perfect hash family; Permutation vector

Indexed keywords


EID: 33646378462     PISSN: 10638539     EISSN: 15206610     Source Type: Journal    
DOI: 10.1002/jcd.20067     Document Type: Article
Times cited : (58)

References (15)
  • 1
    • 84974628131 scopus 로고    scopus 로고
    • Almost independent and weakly biased arrays: Efficient constructions and cryptologic applications, Adv Cryptol (Crypto 2000)
    • J. Bierbrauer and H. Schellwatt, Almost independent and weakly biased arrays: Efficient constructions and cryptologic applications, Adv Cryptol (Crypto 2000), Lecture Notes in Computer Science 1880(2000), 533-543.
    • (2000) Lecture Notes in Computer Science , vol.1880 , pp. 533-543
    • Bierbrauer, J.1    Schellwatt, H.2
  • 3
    • 0037681012 scopus 로고    scopus 로고
    • On the state of strength-three covering arrays
    • M. A. Chateauneuf and D. L. Kreher, On the state of strength-three covering arrays, J Combin Des, 10(4) (2002), 217-238.
    • (2002) J Combin Des , vol.10 , Issue.4 , pp. 217-238
    • Chateauneuf, M.A.1    Kreher, D.L.2
  • 4
    • 84890038185 scopus 로고    scopus 로고
    • Augmented simulated annealing to build interaction test suites
    • M. B. Cohen, C. J. Colbourn, and A. C. H. Ling, Augmented simulated annealing to build interaction test suites, Discrete Math, to appear.
    • Discrete Math
    • Cohen, M.B.1    Colbourn, C.J.2    Ling, A.C.H.3
  • 8
    • 0030538878 scopus 로고
    • T-covering arrays: Upper bounds and Poisson approximations
    • A. P. Godbole, D. E. Skipper, and R. A. Sunley, t-covering arrays: Upper bounds and Poisson approximations, Combin Probab Comput 5(1966), 105-117.
    • (1966) Combin Probab Comput , vol.5 , pp. 105-117
    • Godbole, A.P.1    Skipper, D.E.2    Sunley, R.A.3
  • 10
    • 2942689600 scopus 로고    scopus 로고
    • Problems and algorithms for covering arrays
    • A. Hartman and L. Raskin, Problems and algorithms for covering arrays, Discrete Math 284/1-3(2004), 149-156.
    • (2004) Discrete Math , vol.284 , Issue.1-3 , pp. 149-156
    • Hartman, A.1    Raskin, L.2
  • 12
    • 0004127220 scopus 로고    scopus 로고
    • 2nd edition, Cambridge, England: Cambridge University Press
    • R. Lidl and H. Niederreiter, Editors, Finite Fields, 2nd edition, Cambridge, England: Cambridge University Press, 1997.
    • (1997) Finite Fields
    • Lidl, R.1    Niederreiter, H.2
  • 14
    • 11144229028 scopus 로고    scopus 로고
    • Group construction of covering arrays
    • DOI 10.1002/jcd.20035
    • K. Meagher and B. Stevens, Group construction of covering arrays, J Combin Des 13(2005), 70-77. (Pubitemid 40054390)
    • (2005) Journal of Combinatorial Designs , vol.13 , Issue.1 , pp. 70-77
    • Meagher, K.1    Stevens, B.2
  • 15
    • 0000319342 scopus 로고
    • Covering arrays and intersecting codes
    • N. J. A. Sloane, Covering arrays and intersecting codes, J Combin Des 1(1993), 51-63.
    • (1993) J Combin Des , vol.1 , pp. 51-63
    • Sloane, N.J.A.1


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