Covering Arrays of Strength Three

    loading  Checking for direct PDF access through Ovid

Abstract

A covering array of sizeN, degreek, orderv and strengtht is a k × N array with entries from a set of v symbols such that in any t × N subarray every t × 1 column occurs at least once. Covering arrays have been studied for their applications to drug screening and software testing. We present explicit constructions and give constructive upper bounds for the size of a covering array of strength three.

Related Topics

    loading  Loading Related Articles