I pick a set of random strings $S$ of length $L$ over an $P$-letter alphabet.  These strings are 'random' in the sense that every character is chosen with uniform random probability over the characters in the alphabet (each character would have a probability of $\frac{1}{P}$ of being chosen).  

Let $H(k)$ be the union of $S$ and the set of strings within Hamming distance $k$ of any string in $S$.  What are the tightest known bounds for the size of $H(k)$?