Jump to content

John Kieffer

Add links
From Wikipedia, the free encyclopedia
(Redirected from User:Mathman8574/sandbox)

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

Education

[edit]

Kieffer received his elementary and high school education in St Louis, Missouri, a bachelor's degree in applied mathematics in 1967 from University of Missouri Rolla, and a master's degree in mathematics in 1968 from University of Illinois Urbana-Champaign. 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.[1][2]

Work history

[edit]

In 1970 Kieffer became an assistant professor at Missouri University of Science and Technology, where he eventually became a full professor.[3] In 1986 he became a full professor at University of Minnesota Twin Cities.[4] Kieffer held visiting appointments at Stanford University, University of Illinois Urbana-Champaign, ETH Zürich, and University of Arizona. He has been the supervisor for 6 Ph.D. theses.[1]

Professional activities

[edit]

During the 1980s, Kieffer was Associate Editor of the IEEE Transactions on Information Theory.[5] In 2004, Kieffer was co-editor of a special issue of the IEEE Transactions on Information Theory entitled "Problems on Sequences: Information Theory and Computer Science Interface". [6] He is a Life Fellow of the Institute of Electrical and Electronics Engineers "for contributions to information theory, particularly coding theory and quantization".[7]

Key works

[edit]

1. Key works on grammar-based coding:

  • Kieffer, J.C.; Yang, En-Hui (2000), "Grammar-based codes: A new class of universal lossless source codes", IEEE Transactions on Information Theory, 46 (3): 737–754, doi:10.1109/18.841160
  • Zhang, Jie; Yang, En-Hui; Kieffer, J.C. (2014), "A Universal Grammar-Based Code For Lossless Compression of Binary Trees", IEEE Transactions on Information Theory, 60 (3): 1373–1386, arXiv:1304.7392, doi:10.1109/TIT.2013.2295392, S2CID 13892229

2. Key works on channel coding:

  • Kieffer, John 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 Transactions on Information Theory, 27 (6): 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", Information 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 Transactions on Information Theory, 29 (1): 42–47, doi:10.1109/TIT.1983.1056622

4. Key works on ergodic theory:

5. Key works on stationary process theory:

  • Gray, Robert M.; Kieffer, J. C. (1980), "Asymptotically Mean Stationary Measures", Annals of Probability, 8 (5): 962–973, doi:10.1214/aop/1176994624
  • Kieffer, John C.; Rahe, Maurice (1981), "Markov channels are asymptotically mean stationary", SIAM Journal on Mathematical Analysis, 12 (3): 293–305, doi:10.1137/0512027

Inventions

[edit]
  • Multilevel Pattern Matching Grammar-Based Code[8]
  • SEQUENTIAL Grammar-Based Code[9]
  • Longest-Match Grammar-Based Code[10]

Impact

[edit]

Kieffer has over 70 journal publications in the mathematical sciences.[11] His research work has attracted over 3000 Google Scholar citations,[12] over 500 MathSciNet citations[13] and over 1000 IEEE Xplore citations.[3] Some of these works have been cited as prior art on various United States patents.[14] 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, namely, the article Lossy Source Coding[15] by Toby Berger and Jerry Gibson, and the article Quantization[16] by Robert M. Gray and David Neuhoff. In addition, the textbook Transmitting and Gaining Data[17] by Rudolf Ahlswede presents several aspects of Kieffer's work.

References

[edit]
  1. ^ a b John Kieffer at the Mathematics Genealogy Project
  2. ^ Kieffer, John Cronan (1970). John Kieffer Ph.D. thesis (Thesis). University of Illinois. Retrieved August 22, 2022.
  3. ^ a b "John C. Kieffer Biography". IEEE Xplore. Retrieved August 21, 2022.
  4. ^ "John Kieffer Emeritus Professor". University of Minnesota. Retrieved August 22, 2022.
  5. ^ "John Kieffer Associate Editor". IEEE Information Theory Society. Retrieved August 22, 2022.
  6. ^ Kieffer, J.C.; Szpankowski, W.; Yang, E.-H. (2004). "Problems on Sequences: Information Theory and Computer Science Interface". IEEE Transactions on Information Theory. 50 (7). IEEE Xplore: 1385–1392. doi:10.1109/TIT.2004.830747. Retrieved August 22, 2022.
  7. ^ "John Kieffer Life Fellow". IEEE. Retrieved August 25, 2022.
  8. ^ 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, S2CID 8191526
  9. ^ 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
  10. ^ 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
  11. ^ "John Kieffer Journal Publication List". University of Minnesota. Retrieved August 25, 2022.
  12. ^ John Kieffer publications indexed by Google Scholar
  13. ^ "John Kieffer MathSciNet Citations". American Mathematical Society. Retrieved August 22, 2022.
  14. ^ Yang, En-Hui; Kieffer, J. C. (May 2000). "Patents Citing Kieffer's Work". IEEE Transactions on Information Theory. 46 (3). IEEE Xplore: 755–777. doi:10.1109/18.841161. Retrieved August 21, 2022.
  15. ^ Berger, T.; Gibson, J. D. (1998), "Lossy source coding", IEEE Transactions on Information Theory, 44 (6): 2693–2723, doi:10.1109/18.720552
  16. ^ Gray, R. M.; Neuhoff, D. L. (1998), "Quantization", IEEE Transactions on Information Theory, 44 (6): 2325–2383, doi:10.1109/18.720541, S2CID 212653679
  17. ^ Ahlswede, R. (2015), Transmitting and Gaining Data, Foundations in Signal Processing, Communications and Networking, vol. 11, Springer International Publishing, doi:10.1007/978-3-319-12523-7, ISBN 978-3-319-12522-0, S2CID 124806197
[edit]
Retrieved from "https://en.wikipedia.org/w/index.php?title=John_Kieffer&oldid=1221784021"