Asymptotic and constructive methods for covering perfect hash families and covering arrays

Charles J. Colbourn, Erin Lanus, Kaushik Sarkar. Asymptotic and constructive methods for covering perfect hash families and covering arrays. Des. Codes Cryptography, 86(4):907-937, 2018. [doi]

@article{ColbournLS18,
  title = {Asymptotic and constructive methods for covering perfect hash families and covering arrays},
  author = {Charles J. Colbourn and Erin Lanus and Kaushik Sarkar},
  year = {2018},
  doi = {10.1007/s10623-017-0369-x},
  url = {https://doi.org/10.1007/s10623-017-0369-x},
  researchr = {https://researchr.org/publication/ColbournLS18},
  cites = {0},
  citedby = {0},
  journal = {Des. Codes Cryptography},
  volume = {86},
  number = {4},
  pages = {907-937},
}