| (86-1) |
I.J. TANEJA (1986), A Short Note on the Redundancy of Degree α, Information Scioences, 39(2), 211-216. |
| 7. |
M.B. Baer (2006), Source coding for quasiarithmetic penalties, IEEE TRANSACTIONS ON INFORMATION THEORY, 52 (10), 4380-4393. |
| 6. |
M. BAYER (2006), Prefix Coding under Siege, http://arxiv.org/abs/cs.IT/0605099 |
| 5. |
M. BAYER (2006), A General Framwork for Codes Involving Reduancy Minimization, IEEE Trans. on Inform. Theory, 52(1), 344-349. Also in: arXiv:cs.IT/0508083 v2 1 Nov 2005. |
| 4. |
M. BAYER (2005), Renyi to Renyi — Source Coding under Siege, preprint. |
| 3. |
M. BAYER (2005), Source Coding for Quasiarithmetic Penalties, preprint. |
| 2. |
J. ABRAHAMS (2001), Code And Parse Trees For Lossless Source Encoding, Communications in Information and Systems, 1(2), 113-146. |
| 1. |
J. ABRAHAMS, HUFFMAN CODE TREES AND VARIANTS |