The paper:
(86-2)
R.M. CAPOCELLI, R. GIANCARO, and I.J. TANEJA (1986), Bounds on the redundancy of Huffman codes, IEEE Trans. Inform. Theory, Vol. IT-32, No. 6, pp. 854–857.

has been cited in:
36.
 S. PIGEON (2003), The Handbook of Lossless Data Compression, Khalid Sayood, ed. Academic Press / Elsevier, Chapter 4, Huffman Coding, Steven Pigeon. ISBN 0-126-20861-1.

35.
 P. FERRAGINA, R.  GIANCARLO, G. MANZIN, et al. (2005), Boosting textual compression in optimal linear time,  JOURNAL OF THE ACM 52 (4): 688-713.

34.
 M. BAYER (2005), Renyi to Renyi — Source Coding under Siege, preprint. 

33.
 S. MOHAJER, P. PAKZAD and A. KAKHBOD (2005), Tight Bounds on the Redundancy of Huffman Codes, arXiv:cs.IT/0508039 v2 5 Aug 2005, preprint, 2005.

32.
 ]K. DENECKER (2003), Verliesloze beeldcompressie en statistische voorspelling aan de hand van contexmodellering, book, Universiteit Gent.

31.
 R. GIANCARLO and M. SCIORTINO (2003), Optimal partitions of strings: A new class of burrows-wheeler compression algorithms, LECTURE NOTES IN COMPUTER SCIENCE, 2676: 129-143.

30.
 C. YE and R.W. YEUNG (2002), A simple upper bound on the redundancy of huffman codes, IEEE Trans. on Inform. Theory, Vol. 48(7), 2132-2138.

29.
 C. YE and R.W. YEUNG (2001), Some basic properties of fix-free codes, IEEE TRANSACTIONS ON INFORMATION THEORY, 47 (1): 72-87.

28.
 J. ABRAHAMS (2001), Code And Parse Trees For Lossless Source Encoding, Communications in Information and Systems, 1(2), 113-146.

27.
 Ph. D. Thesis - U. GÜNTHER (1998), Robust Source Coding with Generalised T-Codes, The University of Auckland, Australia.

26.
 R. De PRISCO and A. De SANTIS (1998),  On Lower Bounds for the Redundancy of Optimal Codes, Design Codes and Cryptography, 15, 29-45.
25.
 R.D. PRISCO and A. De SANTIS (1998), On the data expansion of the Huffman compression algorithm, COMPUTER JOURNAL, 41 (3): 137-144.

24.
 R.D. PRISCO and A. De SANTIS (1997), A new bound for the data expansion of Huffman codes, IEEE TRANSACTIONS ON INFORMATION THEORY, 43 (6): 2028-2032.

23.
 R.D. PRISCO and A. De SANTIS (1996), On the Redundancy Achieved by Huffman Codes (Technical Report - MIT), INFORMATION SCIENCES, 88 (1-4): 131-148.

22.
 A. MOFFAT, T.C. BELL and I.H. WITTEN (1995), Lossless Compression for Text and Images Alistair Moffat - Survey Paper

21.
 P.M. FENWICK (1995),  HUFFMAN CODE EFFICIENCIES FOR EXTENSIONS OF SOURCES, IEEE TRANSACTIONS ON COMMUNICATIONS, 43 (2-4): 163-165 Part 1 FEB-APR.

20.
 R.M. CAPOCELLI, A. DE SANTIS and G. PERSIANO (1994), BINARY PREFIX CODES ENDING IN A 1, IEEE TRANSACTIONS ON INFORMATION THEORY, 40 (4): 1296-1302. 

19.
A. BOOKSTEIN and S.T. KLEIN (1993), Is Huffman Coding Dead?, COMPUTING, 50 (4): 279-296.

18.
 R. M. CAPOCELLI and A. DE SANTIS (1992), Variations on a Theme by Gallager, “Image and Text Compression”, Ed. James A. Storer, pp. 181-213, Kluwer Academic Publishers, Dordrecht, 1992, ISBN 0-7923-9243-4..

17.
 P.G. HOWARD and J.S. VITTER (1992), Practical Implementations of Arithmetic Coding,  Technical Report No. 92-18, Department of Computer Science, Brown University.  Also in: Image and Text Compression, J.A. Storer Ed., Kluwer Academic Publishers, Norwell, M.A., 85-112.

16.
 T. KOSKI and L.E. PERSSON (1992), SOME PROPERTIES OF GENERALIZED EXPONENTIAL ENTROPIES WITH APPLICATIONS TO DATA-COMPRESSION, INFORMATION SCIENCES, 62 (1-2): 103-132.

15.
 R.M. CAPOCELLI and A. DE SANTIS (1992), ON THE REDUNDANCY OF OPTIMAL CODES WITH LIMITED WORD-LENGTH, IEEE TRANSACTIONS ON INFORMATION THEORY, 38 (2): 439-445 Part 1.

14.
 D. MANSTETTEN (1992), Tight Bounds on the Redundancy of Huffman Codes, IEEE Trans. on Inform. Theory, 38(1), 144-151.

13.
 R.M. CAPOCELLI and A. DE SANTIS (1991), MINIMUM CODEWORD LENGTH AND REDUNDANCY OF HUFFMAN CODES, LECTURE NOTES IN COMPUTER SCIENCE, 514: 309-317.

12.
 R.M. CAPOCELLI and A. DESANTIS (1991),  NEW BOUNDS ON THE REDUNDANCY OF HUFFMAN CODES,  IEEE TRANSACTIONS ON INFORMATION THEORY, 37 (4): 1095-1104.

11.
 R.M. CAPOCELLI and A. DESANTIS (1991),  A NOTE ON D-ARY HUFFMAN CODES,  IEEE TRANSACTIONS ON INFORMATION THEORY, 37(1): 174-179.

10.
 R.W. YEUNG (1991), LOCAL REDUNDANCY AND PROGRESSIVE BOUNDS ON THE REDUNDANCY OF A HUFFMAN CODE, IEEE TRANSACTIONS ON INFORMATION THEORY, 37 (3): 687-691 Part 1.   

9.
 K. BIRMIWAL (1990), THE MINIMUM CODEWORD LENGTH AND REDUNDANCY IN THE BINARY HUFFMAN CODE FOR UNCERTAIN SOURCES, IEEE TRANSACTIONS ON INFORMATION THEORY, 36 (2): 439-443.

8.
 R.M. CAPOCELLI and A. DESANTIS (1989),  TIGHT UPPER-BOUNDS ON THE REDUNDANCY OF HUFFMAN CODES,  IEEE TRANSACTIONS ON INFORMATION THEORY, 35 (5): 1084-1091.

7.
 D.A. LELEWER and D. S. HIRSCHBERG (1987),  Data Compression -Survey Paper - COMPUTING SURVEYS, 19 (3): 261-296

6.
 J. ABRAHAMS, HUFFMAN CODE TREES AND VARIANTS

5.
 P. FERRAGINA, R. GIANCARLO, G. MANZINI and M. SCIORTINO, Boosting Textual Compression in Optimal Linear Time.

4.
 D.A. LELEWER and D. S. HIRSCHBERG,  Data compression - On line book

3.
 Duomenø kompresija Literatûra - It seems that it is the on-line russian version of the above book by D.A. LELEWER and D. S. HIRSCHBERG .

2.
 JAY CHENG - Web site - Reading material - Department of Electrical Engineering and Institute of Communications Engineering  National Tsing Hua University, Taiwan, R.O.C..

1.
 S. MOHAJER , P. PAKZAD and A. KAKHBOD (2005), Tight Bounds on the Redundancy of Huffman Codes, arXiv:cs.IT/0508039 v2 5 Aug 2005., pre-print.