Covering perfect hash families and covering arrays of higher index

DOI10.22108/IJGT.2023.137230.1836MaRDI QIDQ6182378zbMATH OpenFDO

Authors Charles J. Colbourn

Publication date 25 January 2024

zbMATH Keywords

finite fieldprobabilistic methodcovering arraycovering perfect hash family

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Combinatorial structures in finite projective spaces (51E20)

Recommendations

• Asymptotic and constructive methods for covering perfect hash families and covering arrays
• Distributing hash families and covering arrays
• Covering arrays and hash families
• Covering arrays of higher strength from permutation vectors
• Subspace restrictions and affine composition for covering perfect hash families

This page was built for publication: Covering perfect hash families and covering arrays of higher index

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6182378)