John Kieffer

John Cronan Kieffer is an American mathematician best known for his work in information theory, ergodic theory, and stationary process theory.

Education

Kieffer received his bachelor's degree in 1967 and his master's degree in 1968. In 1970, under Robert B. Ash, he received the Ph.D. degree in mathematics from University of Illinois Urbana-Champaign with thesis A Generalization of the Shannon-McMillan Theorem and Its Application to Information Theory.

Work History

In 1970 Kieffer became an assistant professor at Missouri University of Science and Technology, where he eventually became a full professor. In 1986 he became a full professor at University of Minnesota Twin Cities. Kieffer held visiting appointments at Stanford University, ETH Zurich, and University of Arizona. He has been the supervisor for 6 Ph.D. theses.

Professional Activities

During 1980-1982, Kieffer was Associate Editor of the IEEE Transactions on Information Theory. In 2004, he was co-editor of a special issue of the IEEE Transactions on Information Theory entitled "Problems on Sequences".[1]. Kieffer is a Life Fellow of the Institute of Electrical and Electronics Engineers.

Key Works

1. Key works on grammar-based coding:

  • Kieffer, J.C.; Yang, E.-H. (2000), "Grammar-based codes: A new class of universal lossless source codes", IEEE Trans. Inf. Theory, 46 (3): 737–754, doi:10.1109/18.841160
  • Zhang, J.; Yang, E.-H.; Kieffer, J.C. (2014), "A Universal Grammar-Based Code For Lossless Compression of Binary Trees", IEEE Trans. Inf. Theory, 60 (3): 1373–1386, doi:10.1109/TIT.2013.2295392

2. Key works on channel coding:

  • Kieffer, J. C. (1974), "A general formula for the capacity of stationary nonanticipatory channels", Information and Control, 26 (4): 381–391, doi:10.1016/S0019-9958(74)80006-9
  • Kieffer, J. C. (1981), "Block coding for weakly continuous channels", IEEE Trans. Inform. Theory, 27: 721–727, doi:10.1109/TIT.1981.1056422

3. Key works on quantization:

  • Gray, R. M.; Kieffer, J. C.; Linde, Y. (1980), "Locally optimal block quantizer design", Inform. and Control, 45 (2): 178--198, doi:10.1016/S0019-9958(80)90313-7
  • Kieffer, J. C. (1983), "Uniqueness of locally optimal quantizer for log-concave density and convex error weighting function", IEEE Trans. Inform. Theory, 29 (1): 42–47, doi:10.1109/TIT.1983.1056622

4. Key works on ergodic theory:

  • Kieffer, J. C. (1975), "A generalized Shannon-McMillan theorem for the action of an amenable group on a probability space", Ann. Probability, 3 (6): 1031–1037, doi:10.1214/aop/1176996230
  • Kieffer, J. C. (1982), "A direct proof that VWB processes are closed in the d-bar metric", Israel J. Math., 41: 154--160, doi:10.1007/BF02760663

5. Key works on stationary process theory:

  • Gray, R.M.; Kieffer, J.C. (1980), "Asymptotically Mean Stationary Measures", Annals of Probability, 8 (5): 962–973, doi:10.1214/aop/1176994624
  • Kieffer, J. C.; Rahe, M. (1981), "Markov channels are asymptotically mean stationary", SIAM J. Math. Anal., 12: 293--305, doi:10.1137/0512027

Inventions
  • Multilevel Pattern Matching Grammar-Based Code[2]
  • SEQUENTIAL Grammar-Based Code[3]
  • Longest-Match Grammar-Based Code[4]

Impact

In 1998, the IEEE Transactions on Information Theory published a special issue consisting of articles that survey research in information theory during 1948-1998. Two of these articles include discussions of Kieffer's work during 1970-1998. One of these articles was written by Toby Berger and Jerry Gibson.[5] The other article was written by Robert M. Gray and David Neuhoff.[6]

Since 1998, some of Kieffer's works have been cited as prior art on various United States patents.[7]

References
  1. Kieffer, J. C.; Szpankowski, W.; Yang, E.-H. (2004), "Problems on Sequences: Information Theory and Computer Science Interface", IEEE Trans. Inform. Theory, 50: 1385–1391, doi:10.1109/TIT.2004.830747
  2. Kieffer, J. C.; Yang, E.-H.; Nelson, G.; Cosman, P. (2000), "Universal lossless compression via multilevel pattern matching", IEEE Trans. Inf. Theory, 46 (4): 1227–1245, doi:10.1109/18.850665
  3. Charikar, M.; Lehman, E.; Liu, D.; Panigrahy, R.; Prabharakan, M.; Sahai, A.; Shelat, A. (2005), "The Smallest Grammar Problem", IEEE Trans. Inf. Theory, 51 (7): 2554–2576, doi:10.1109/tit.2005.850116, S2CID 6900082
  4. Bannai, H. (2016), "Grammar Compression", Encyclopedia of Algorithms, Springer New York, pp. 861–866, doi:10.1007/978-1-4939-2864-4_635, ISBN 978-1-4939-2863-7
  5. Berger, T.; Gibson, J. D. (1998), "Lossy source coding", IEEE Transactions on Information Theory, 44 (6): 2693–2723, doi:10.1109/18.720552
  6. Gray, R. M.; Neuhoff, D. L. (1998), "Quantization", IEEE Transactions on Information Theory, 44 (6): 2325–2383, doi:10.1109/18.720541
  7. Yang, E.-H.; Kieffer, J. C. (2000), "Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform. I. Without context models", IEEE Transactions on Information Theory, 46 (3): 755–777, doi:10.1109/18.841161
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.