๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Genetic search for Golomb arrays

โœ Scribed by Robinson, J.P.


Book ID
114541600
Publisher
IEEE
Year
2000
Tongue
English
Weight
98 KB
Volume
46
Category
Article
ISSN
0018-9448

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Genetics: Searching for answers
โœ Williams, Sarah C. P. ๐Ÿ“‚ Article ๐Ÿ“… 2012 ๐Ÿ› Nature Publishing Group ๐ŸŒ English โš– 577 KB
Searching for array standards in Rockvil
โœ Star, Robert A.; Rasooly, Rebekah S. ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Nature Publishing Group ๐ŸŒ English โš– 448 KB
Upper bounds for covering arrays by tabu
โœ Kari J. Nurmela ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 208 KB

A t-covering array is a collection of k vectors in a discrete space with the property that, in any t coordinate positions, all combinations of the coordinate values occur at least once. Such arrays have applications, for example, in software testing and data compression. Covering arrays are sometime