New search algorithm for minimum redundancy linear arrays

An algorithm for finding minimum redundancy linear arrays (MRLAs) of longer lengths than previously possible is presented. The results obtained to date by this algorithm, which go beyond previously published results (length 68 arrays) are summarized. Included is a table of the number of MRLAs as a function of array length (up through length 90). In the process of making this table, errors in two references were discovered and corrected. Such information, along with the array patterns themselves, is extremely valuable in developing suboptimal searching techniques for still longer, but sparse, arrays