References

• 1. 1)
     • P. Humblet . Generalization of Huffman coding to minimize the probability of buffer overflow. IEEE Trans. Inf. Theory , 2 , 230 - 232
  2. 2)
     • T. Yamano . Information theory based on nonadditive information content. Phys. Rev. E , 4
  3. 3)
     • J.-F. Bercher . Source coding with escort distributions and Rényi entropy bounds. Phys. Lett. A , 36 , 3235 - 3238
  4. 4)
     • M. Baer . Source coding for quasiarithmetic penalties. IEEE Trans. Inf. Theory , 10 , 4380 - 4393
  5. 5)
     • M. Baer . Optimal prefix codes for infinite alphabets with nonlinear costs. IEEE Trans. Inf. Theory , 3 , 1273 - 1286
  6. 6)
     • R.P. Singh , R. Kumar , R.K. Tuteja . Application of Hölder's inequality in information theory. Inf. Sci , 145 - 154
  7. 7)
     • F. Chapeau-Blondeau , A. Delahaies , D. Rousseau . Source coding with Tsallis entropy. Electron. Lett. , 3 , 187 - 188
  8. 8)
     • J. Aczel , Z. Daroczy . (1975) On measures of information and their characterizations.
  9. 9)
     • L.L. Campbell . A coding theorem and Rényi's entropy. Inf. Control , 4 , 423 - 429