1. Cohen, G., Honkala, I., Litsyn, S., Lobstein, A.: Covering Codes. North-Holland, Amsterdam (1997)
2. Cormen, T., Leiserson, C., Rivest, R.: Introduction to Algorithms. MIT Press, Cambridge (1990)
3. Lecture Notes in Computer Science;E. Dantsin,2000
4. Impagliazzo, R., Shaltiel, R., Wigderson, A.: Extractors and pseudo-random generators with optimal seed length. In: Proceedings of the 32nd ACM Symposium on the Theory of Computing, pp. 1–10. ACM, New York (2000)
5. Krivelevich, M., Sudakov, B., Vu, V.: Covering codes with improved density. IEEE Transactions on Information Theory 49, 1812–1815 (2003)