An upper bound on the volume of discrete spheres
Hans‐Andrea Loeliger · IEEE Transactions on Information Theory · 1994
Finite-length sequences over a finite alphabet with weights are considered. An information-theoretic upper bound on the number of such sequences whose weight does not exceed some given threshold is presented.>