Table of Contents Author Guidelines Submit a Manuscript
International Journal of Mathematics and Mathematical Sciences
Volume 2013, Article ID 768384, 6 pages
http://dx.doi.org/10.1155/2013/768384
Research Article

Shannon's Random-Cipher Result and the Generalized -Norm Entropy of Type

1Department of Mathematics, College of Natural Sciences, Arba Minch University, Arba Minch, Ethiopia
2Department of Mathematics, Geeta Institute of Management & Technology, Kanipla, Kurukshetra, Haryana 136131, India

Received 22 April 2013; Revised 30 June 2013; Accepted 28 July 2013

Academic Editor: Sever Dragomir

Copyright © 2013 Satish Kumar and Arun Choudhary. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. C. E. Shannon, “Communication theory of secrecy systems,” The Bell System Technical Journal, vol. 28, pp. 656–715, 1949. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  2. M. E. Hellman, “An extension of the Shannon theory approach to cryptography,” IEEE Transactions on Information Theory, vol. 23, no. 3, pp. 289–294, 1977. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  3. S. C. Lu, “The existence of good cryptosystems for key rates greater than the message redundancy,” IEEE Transactions on Information Theory, vol. 25, no. 4, pp. 475–479, 1979. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  4. P. K. Sahoo, “Renyi's entropy of order α and Shannon's random cipher result,” Journal of Combinatorics, Information & System Sciences, vol. 8, no. 4, pp. 263–270, 1983. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  5. S. Arimoto, “Information-theoretical considerations on estimation problems,” Information and Computation, vol. 19, pp. 181–194, 1971. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  6. D. E. Boekee and J. C. A. Van der Lubbe, “The R-norm information measure,” Information and Control, vol. 45, no. 2, pp. 136–155, 1980. View at Publisher · View at Google Scholar · View at MathSciNet
  7. A. Renyi, “On measure of entropy and information,” in Proceedings of the 4th Berkeley Symposium on Mathematical Statistics and Probability, vol. 1, pp. 547–561, Berkeley, Calif, USA, June 1961.
  8. J. Havrda and F. Charvát, “Quantification method of classification processes. Concept of structural α-entropy,” Kybernetika, vol. 3, pp. 30–35, 1967. View at Google Scholar · View at MathSciNet
  9. Z. Daroczy, “Generalized information functions,” Information and Computation, vol. 16, pp. 36–51, 1970. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  10. D. S. Hooda and A. Ram, “Characterization of the generalized R-norm entropy,” Caribbean Journal of Mathematical and Computer Science, vol. 8, no. 1, 2, pp. 18–31, 1998. View at Google Scholar
  11. E. F. Beckenbach and R. Bellman, Inequalities, Springer, New York, NY, USA, 1971. View at MathSciNet