Explicit Constructions of Rödl's Asymptotically Good Packings and Coverings
Nikolai N. Kuzjurin · Combinatorics Probability Computing · 2000
For any fixed l < k we present families of asymptotically good packings and coverings of the l-subsets of an n-element set by k-subsets, and an algorithm that, given a natural number i, finds the ith k-subset of the family in time and space polynomial in log n.