1. R. Ahlswede and I. Wegener: Search problems, John Wiley & Sons, Inc., New York, 1987.
2. J. A. Aslam and A. Dhagat: Searching in the presence of linearly bounded errors, in: Proceedings of the twenty-third annual ACM symposium on Theory of computing (STOC’ 91), 486–493, 1991.
3. H. Aydinian, F. Cicalese and C. Deppe, eds.: Information Theory, Combinatorics, and Search Theory, Springer-Verlag Berlin Heidelberg, 2013.
4. D. W. Boyd: The asymptotic number of solutions of a diophantine equation from coding theory, Journal of Combinatorial Theory, Ser. A
18 (1975), 210–215.
5. R. M. Capocelli, R. Giancarlo and I. J. Taneja: Bounds on the redundancy of Huffman codes, IEEE Transactions on Information Theory IT-32 (1986), 854–857.