Information and Coding Theory and Applications

Organizer: D. S. Hooda J. P. Institute of Engineering and Technology, Guna, MP, India, ds_hooda@yahoo.co.in

Chair: D. S. Hooda J. P. Institute of Engineering and Technology, Guna, MP, India, ds_hooda@yahoo.co.in

Description: Previously information theory used to be considered a branch of communication theory as it answers two fundamental questions in communication theory: What is the ultimate data compression and what is the ultimate transmission rate of communication? But now it has made enormous contributions to statistical physics, computer science, and statistical inference and to probability and statistics.
Modern work on communication aspects of information theory has concentrated on network information theory: the theory of the simultaneous rates of communication from many senders to many receivers in a communication network. Some of the trade-offs of rates between senders and receivers are unexpected, and all have mathematical simplicity. A unifying theory, however, remains to be found out.
There is a strong relationship between algorithmic complexity and computational complexity. One can think about computational complexity and Kolmogorov complexity as there are two axes corresponding to program running time and program length. Kolmogorov complexity focuses on minimizing along the first axis. There is a lot of scope to work on the simultaneous minimization of the two.
Jaynes' maximum entropy principle, Kullback-Leibler's minimum cross entropy principle and minimum loss of information principle are important principles. These principles can be generalized by using the generalized measures of entropy and cross entropy in place of Shannon' entropy and Kullback-Liebler' cross entropy. Reliability theory, marketing, measurement of risk in investments, quality control, log linear models, etc., are the areas where the generalized optimization principles can find applications.

Speakers:

  1. Lower and Upper Bounds Code Length
  2. D.S.Hooda, Jaypee Institute of Engineering and Technology, Guna(INDIA)
  3. Applications of InformationLo Theory in Generalized Additive Models
  4. Hong Gu , Department of Math. & Stat., Dalhousie University, Halifax,USA.
  5. Random Testing and Information Measures
  6. Maedeh Raznahan, Department of statistics, Islamic Ajad University, North Tehran Branch.
  7. The Discovery of Goldbach Conjecture Code and Proof of Conjecture
  8. QingHui Chen, Goldbach Conjucture Research, W153 711 USA.
  9. Bounds on Two Generalized Cost Measures
  10. D.K.Sharma, Jaypee Institute of Engineering and Technology, Guna(INDIA)
  11. The Convex Set of Fuzzy Random Vectors
  12. Qiao Zhong, Economies Mangement College, China Agriculture University, China.
  13. Optimum Synchronized Codes - Gaussian Sources
  14. Rajiv K. Tripathi, Jaypee Institute of Engineering and Technology, Guna(INDIA)

Presented jointly by
the Department of Statistics and Finance, University of Science and Technology of China and the Forum for Interdisciplinary Mathematics.


Co-sponsored by: