A circuit \mathcal{C} samples a distribution \mathbf{X} with an error \epsilon if the statistical distance between the output of \mathcal{C} on the uniform input and \mathbf{X} is \epsilon. We study the hardness of sampling a uniform distribution over the set of n-bit strings of Hamming weight k denoted by \mathbf{U}^n_k ... more >>>