Asymptotic and constructive methods for covering perfect hash families and covering arrays - Colbourn, Charles J.; Lanus, Erin; Sarkar, Kaushik (Designs, codes, and cryptography, 2018)
Keywords: Algorithms; Arrays; Asymptotic methods; Circuits; Coding and Information Theory; Columns (structural); Computer Science; Construction methods; Cryptology; Data Structures and Information Theory; Discrete Mathematics in Computer Science; Hash based algorithms; Information and Communication; Polynomials; Probabilistic methods; Resampling; Strength; Upper bounds; Conditional expectation algorithm; Asymptotic bound; 05B40; 51E20; 05D40; 05E18; Covering perfect hash family; Covering array; 05B15