Kenneth A. Zeger
`
`- Professor and consultant -
`
`January 8, 2017
`
`Personal Data
`
`Email: zeger@ZundaLLC.com
`Web: http://ZundaLLC.com (company)
`http://zeger.us (university)
`Citizenship: USA
`
`Academic Degrees
`
`Ph.D (ECE):
`University of California, Santa Barbara (1990)
`M.A. (Mathematics): University of California, Santa Barbara (1989)
`S.M. (EECS):
`Massachusetts Institute of Technology (1984)
`S.B.
`(EECS):
`Massachusetts Institute of Technology (1984)
`
`Faculty Positions
`
`University of California, San Diego
`
`Professor of Electrical Engineering (1998-present)
`-
`- Associate Professor of Electrical Engineering (1996-1998)
`
`University of Illinois, Urbana-Champaign - Associate Professor of Electrical Engineering (1995-1996)
`- Assistant Professor of Electrical Engineering (1992-1995)
`
`University of Hawaii
`
`- Assistant Professor of Electrical Engineering (1990-1992)
`
`Honors and Awards
`
`• IEEE Fellow (2000)
`• NSF Presidential Young Investigator Award (1991)
`• United States Mathematical Olympiad (1980)
`
`Page 1 of 21
`
`CV of K. Zeger
`
`IPR2016-01203 Ex. 2009
`Page 1 of 21
`
`

`

`Consulting Experience
`
`January 8, 2017
`
`Clients:
`
`• Automatic Data Processing Co.
`• Hewlett-Packard Laboratories
`• U.S. Department of Defense
`• MITRE Co.
`• Nokia Telecommunications Inc.
`• Prominent Communications Inc. (Chair of Technical Advisory Board)
`• ViaSat Inc.
`• Xerox Co. Palo Alto Research Center
`• Zeger-Abrams Inc.
`• Zunda LLC (President)
`• Expert Witness in numerous patent infringement and trade secret litigations.
`
`Topics:
`
`• Image, fax, video, vision, television coding.
`• Speech coding and recognition, audio coding, telephony.
`• Electronic hardware devices: cell phones, printers, cameras, TV, computers, dongles, etc.
`• Protocols, networks, Internet, security, GPS.
`• Digital and wireless communications.
`• Error correcting codes.
`• Communication protocols.
`• Software: C, C++, C#, BASIC, Lisp, Fortran, Cobol, Algol, Pascal, Assembler, TMS320, Java,
`DSP, Verilog, HTML, JavaScript, Perl, Visual Basic, VHDL.
`• National security topics.
`
`Page 2 of 21
`
`CV of K. Zeger
`
`IPR2016-01203 Ex. 2009
`Page 2 of 21
`
`

`

`Professional Activities
`
`January 8, 2017
`
`• Board of Governors of IEEE Information Theory Society (1998-2000, 2005-2007, and 2008-
`2010)
`• Associate Editor At-Large of IEEE Transactions on Information Theory (1995-1998).
`• Steering Committee member of Fourth Workshop on Network Coding, Theory, and Applications
`(2007).
`• Co-organizer of: Third Workshop on Network Coding, Theory, and Applications, San Diego
`(2007).
`• Co-organizer of NSF Workshop on Joint Source-Channel Coding, San Diego, California. (1999)
`• Co-organizer of IEEE Information Theory Workshop, San Diego, California. (1998)
`• Co-organizer of Allerton Conference on Communication, Control, and Computing (1995)
`• Co-organizer of IEEE Communication Theory Workshop, Ojai, California. (1990)
`• International Advisory Committee of International Symposium on Spread Spectrum Techniques
`and Applications (ISSTA) (Taichung, Taiwan 2010)
`• Program Committee of Information Theory Workshop (ITW) (Jerusalem, Israel, 2015)
`• Program Committee member of International Symposium on Network Coding (NetCod) (Sydney,
`Australia, 2015)
`• Program Committee member of International Symposium on Network Coding (NetCod) (Bei-
`jing, China, 2011)
`• Program Committee member of Workshop on Network Coding, Theory, and Applications (Net-
`Cod) (Lausanne, Switzerland, 2009)
`• Program Committee member of Workshop on Network Coding, Theory, and Applications (Net-
`Cod) (Hong Kong, 2008)
`• Program Committee member of Workshop on Network Coding, Theory, and Applications (Net-
`Cod) (Boston, 2006)
`• Program Committee member of International Symposium on Information Theory (ISIT) (Toronto,
`Canada 2008)
`• Program Committee member of International Symposium on Information Theory (ISIT) (Ade-
`laide, Australia 2005)
`• Program Committee member of International Conference on Image Processing (ICIP) (Atlanta,
`Georgia, September 2006).
`• Program Committee member of International Conference on Image Processing (ICIP) (Genova,
`Italy, 2005)
`• Program Committee member of International Conference on Image Processing (ICIP) (Singapore
`2004)
`• Program Committee member of International Conference on Image Processing (ICIP) (Barcelona,
`Spain, 2003)
`• Program Committee member of International Symposium on Information Theory and its Appli-
`cations (Monterey, California 2016)
`• Program Committee member of International Symposium on Information Theory and its Appli-
`cations (Melbourne, Australia 2014)
`
`Page 3 of 21
`
`CV of K. Zeger
`
`IPR2016-01203 Ex. 2009
`Page 3 of 21
`
`

`

`January 8, 2017
`
`• Program Committee member of International Symposium on Information Theory and its Appli-
`cations (Honolulu, Hawaii 2012)
`• Program Committee member of International Symposium on Information Theory and its Appli-
`cations (Taichung, Taiwan 2010)
`• Program Committee member of International Symposium on Information Theory and its Appli-
`cations (Auckland, New Zealand 2008)
`• Program Committee member of International Symposium on Information Theory and its Appli-
`cations (Soeul, Korea 2006)
`• Program Committee member of International Symposium on Information Theory and its Appli-
`cations (Xian, China, 2002)
`• Program Committee member of International Symposium on Information Theory and its Appli-
`cations (Hawaii, 2000)
`• Program Committee member of Data Compression Conference (Salt Lake City, Utah, 1996-
`2007)
`• Plenary speaker at Nottingham Trent Univ. Workshop on Prob., Theory, & Appl. (England, 1998)
`• Plenary speaker at IEEE Communication Theory Workshop (Destin, Florida, 1996)
`• IEEE Communication Theory Technical Committee
`• IEEE Signal Processing and Communications Electronics Technical Committee
`• Started U.S.-Hungary Research Exchange Program
`• MIT Educational Council (1985-present)
`
`Page 4 of 21
`
`CV of K. Zeger
`
`IPR2016-01203 Ex. 2009
`Page 4 of 21
`
`

`

`Research Interests
`
`January 8, 2017
`
`Source/Channel Coding, Image/Speech Compression, Networking, Statistical Learning and Pat-
`tern Matching, Information Theory, Graph and Complexity Theory, Combinatorial Monoid &
`Group Theory
`
`Teaching Experience (g = grad, u = undergrad)
`
`Calculus (u)
`Probability (u)
`Signals and Systems (u)
`Circuits and Systems (u)
`Information Theory (g)
`Source Coding (g)
`Random Processes (g)
`
`Page 5 of 21
`
`CV of K. Zeger
`
`IPR2016-01203 Ex. 2009
`Page 5 of 21
`
`

`

`Publications of Kenneth Zeger
`
`January 8, 2017
`
`Journal Papers:
`
`1. Kenneth Zeger and Allen Gersho, “Zero-Redundancy Channel Coding in Vector Quantisation”,
`IEE Electronics Letters, vol. 23, no. 12, pp. 654-656, June 1987.
`
`2. Kenneth Zeger and Allen Gersho, “A Stochastic Relaxation Algorithm for Improved Vector
`Quantiser Design”, IEE Electronics Letters, vol. 25, no. 14, pp. 896-898, July 1989.
`
`3. Kenneth Zeger and Allen Gersho, “Pseudo-Gray Coding”, IEEE Transactions on Communica-
`tions, vol. 38, no. 12, pp. 2147-2158, December 1990.
`
`4. Hai-Ning Liu, Celia Wrathall, and Kenneth Zeger, “Efficient Solution of some Problems in a
`Free Partially Commutative Monoid”, Information and Computation, vol. 89, no. 2, pp. 180-198,
`December 1990.
`
`5. Kenneth Zeger, “Corrections to ‘Gradient Algorithms for Designing Predictive Vector Quantiz-
`ers’ ”, IEEE Transactions on Signal Processing, vol. 39, no. 3, pp. 764-765, March 1991.
`
`6. Kenneth Zeger, Jacques Vaisey, and Allen Gersho, “Globally Optimal Vector Quantizer De-
`sign by Stochastic Relaxation”, IEEE Transactions on Signal Processing, vol. 40, no. 2, pp.
`310-322, February 1992.
`
`7. Eyal Yair, Kenneth Zeger, and Allen Gersho, “Competitive Learning and Soft Competition for
`Vector Quantizer Design”, IEEE Transactions on Signal Processing, vol. 40, no. 2, pp. 294-309,
`February 1992.
`
`8. Kris Popat and Kenneth Zeger, “Robust Quantization of Memoryless Sources using Dispersive
`FIR Filters”, IEEE Transactions on Communications, vol. 40, no. 11, pp. 1670-1674, November
`1992.
`
`9. Kenneth Zeger and Miriam R. Kantorovitz, “Average Number of Facets per Cell in Tree-
`Structured Vector Quantizer Partitions”, IEEE Transactions on Information Theory, vol. 39, no.
`3, pp. 1053-1055, May 1993.
`
`10. Tam´as Linder, Christian Schlegel, and Kenneth Zeger, “Corrected Proof of de Buda’s The-
`orem”, IEEE Transactions on Information Theory, vol. 39, no. 5, pp. 1735-1737, September
`1993.
`
`11. Kenneth Zeger, Anurag Bist, and Tam´as Linder, “Universal Source Coding with Codebook
`Transmission”, IEEE Transactions on Communications, vol. 42, no. 2, pp. 336-346, February
`1994.
`
`12. Tam´as Linder and Kenneth Zeger, “Asymptotic Entropy Constrained Performance of Tes-
`sellating and Universal Randomized Lattice Quantization”, IEEE Transactions on Information
`Theory, vol. 40, no. 2, pp. 575-579, March 1994.
`
`Page 6 of 21
`
`CV of K. Zeger
`
`IPR2016-01203 Ex. 2009
`Page 6 of 21
`
`

`

`January 8, 2017
`13. Tam´as Linder, G´abor Lugosi, and Kenneth Zeger, “Recent Trends in Lossy Source Coding”,
`Journal on Communications (Hungary), vol. XLV, pp. 16-22, March 1994.
`
`14. Kenneth Zeger and Allen Gersho, “Number of Nearest Neighbors in a Euclidean Code”, IEEE
`Transactions on Information Theory, vol. 40, no. 5, pp. 1647-1649, September 1994.
`
`15. Kenneth Zeger and Vic Manzella, “Asymptotic Bounds on Optimal Noisy Channel Quanti-
`zation Via Random Coding”, IEEE Transactions on Information Theory, vol. 40, no. 6, pp.
`1926-1938, November 1994.
`
`16. Tam´as Linder, G´abor Lugosi, and Kenneth Zeger, “Rates of Convergence in the Source Cod-
`ing Theorem, in Empirical Quantizer Design, and in Universal Lossy Source Coding”, IEEE
`Transactions on Information Theory, vol. 40, no. 6, pp. 1728-1740, November 1994.
`
`17. G´abor Lugosi and Kenneth Zeger, “Nonparametric Estimation via Empirical Risk Minimiza-
`tion”, IEEE Transactions on Information Theory, vol. 41, no. 3, pp. 677-687, May 1995.
`
`18. Tam´as Linder, G´abor Lugosi, and Kenneth Zeger, “Fixed Rate Universal Lossy Source Cod-
`ing and Rates of Convergence for Memoryless Sources”, IEEE Transactions on Information The-
`ory, vol. 41, no. 3, pp. 665-676, May 1995.
`
`19. G´abor Lugosi and Kenneth Zeger, “Concept Learning using Complexity Regularization”, IEEE
`Transactions on Information Theory, vol. 42, no. 1, pp. 48-54, January 1996.
`
`20. Tam´as Linder and Kenneth Zeger, “On the Cost of Finite Block Length in Quantizing Un-
`bounded Memoryless Sources”, IEEE Transactions on Information Theory, vol. 42, no. 2, pp.
`480-487, March 1996.
`
`21. Tam´as Linder, G´abor Lugosi, and Kenneth Zeger, “Empirical Quantizer Design in the Pres-
`ence of Source Noise or Channel Noise”, IEEE Transactions on Information Theory, vol. 43, no.
`2, pp. 612-637, March 1997.
`
`22. Jon Hamkins and Kenneth Zeger, “Improved Bounds on Maximum Size Binary Radar Arrays”,
`IEEE Transactions on Information Theory, vol. 43, no. 3, pp. 997-1000, May 1997.
`
`23. P. Greg Sherwood and Kenneth Zeger, “Progressive Image Coding on Noisy Channels”, IEEE
`Signal Processing Letters, vol. 4, no. 7, pp. 189-191, July 1997.
`
`24. Bertrand Hochwald and Kenneth Zeger, “Tradeoff Between Source and Channel Coding”,
`IEEE Transactions on Information Theory, vol. 43, no. 5, pp. 1412-1424, September 1997.
`
`25. Tam´as Linder, Vahid Tarokh, and Kenneth Zeger, “Existence of Optimal Codes for Infinite
`Source Alphabets”, IEEE Transactions on Information Theory, vol. 43, no. 6, pp. 2026-2028,
`November 1997.
`
`26. Jon Hamkins and Kenneth Zeger, “Asymptotically Dense Spherical Codes - Part I: Wrapped
`Spherical Codes”, IEEE Transactions on Information Theory, vol. 43, no. 6, pp. 1774-1785,
`November 1997.
`
`Page 7 of 21
`
`CV of K. Zeger
`
`IPR2016-01203 Ex. 2009
`Page 7 of 21
`
`

`

`January 8, 2017
`
`27. Jon Hamkins and Kenneth Zeger, “Asymptotically Dense Spherical Codes - Part II: Laminated
`Spherical Codes”, IEEE Transactions on Information Theory, vol. 43, no. 6, pp, 1786-1798,
`November 1997.
`
`28. Andr´as M´ehes and Kenneth Zeger, “Binary Lattice Vector Quantization with Linear Block
`Codes and Affine Index Assignments”, IEEE Transactions on Information Theory, vol. 44, no.
`1, pp. 79-94, January 1998.
`
`29. Pamela Cosman and Kenneth Zeger, “Memory Constrained Wavelet-Based Image Coding”,
`IEEE Signal Processing Letters, vol. 5, no. 9, pp. 221-223, September 1998.
`
`30. P. Greg Sherwood and Kenneth Zeger, “Error Protection for Progressive Image Transmission
`Over Memoryless and Fading Channels”, IEEE Transactions on Communications, vol. 46, no.
`12, pp. 1555-1559, December 1998.
`
`31. Tam´as Linder, Ram Zamir, and Kenneth Zeger, “High-Resolution Source Coding for Non-
`difference Distortion Measures: Multidimensional Companding”, IEEE Transactions on Infor-
`mation Theory, vol. 45, no. 2, pp. 548-561, March 1999.
`
`32. Andr´as M´ehes and Kenneth Zeger, “Randomly Chosen Index Assignments Are Asymptoti-
`cally Bad for Uniform Sources”, IEEE Transactions on Information Theory, vol. 45, no. 2, pp.
`788-794, March 1999.
`
`33. Vahid Tarokh, Alexander Vardy, and Kenneth Zeger, “Universal Bound on the Performance
`of Lattice Codes”, IEEE Transactions on Information Theory, vol. 45, no. 2, pp. 670-681, March
`1999.
`
`34. Akiko Kato and Kenneth Zeger, “On the Capacity of Two-Dimensional Run Length Con-
`strained Channels”, IEEE Transactions on Information Theory, vol. 45, no. 4, pp. 1527-1540,
`July 1999.
`
`35. Andr´as Gy¨orgy, Tam´as Linder, and Kenneth Zeger, “On the Rate-Distortion Function of Ran-
`dom Vectors and Stationary Sources with Mixed Distributions”, IEEE Transactions on Informa-
`tion Theory, vol. 45, no. 6, pp. 2110-2115, September 1999.
`
`36. Hisashi Ito, Akiko Kato, Zsigmond Nagy, and Kenneth Zeger, “Zero Capacity Region of
`Multidimensional Run Length Constraints”, The Electronic Journal of Combinatorics, vol. 6(1),
`no. R33, 1999.
`
`37. Bal´azs K´egl, Adam Krzy˙zak, Tam´as Linder, and Kenneth Zeger, “Learning and Design of
`Principal Curves”, IEEE Transactions on Pattern Matching and Machine Intelligence, vol. 22,
`no. 3, pp. 281-297, March 2000.
`
`38. Zsigmond Nagy and Kenneth Zeger, “Capacity Bounds for the Three-dimensional (0, 1) Run
`Length Limited Channel”, IEEE Transactions on Information Theory, vol. 46, no. 3, pp. 1030-
`1033, May 2000.
`
`Page 8 of 21
`
`CV of K. Zeger
`
`IPR2016-01203 Ex. 2009
`Page 8 of 21
`
`

`

`January 8, 2017
`
`39. Pamela Cosman, John Rogers, P. Greg Sherwood, and Kenneth Zeger, “Combined Forward
`Error Control and Packetized Zerotree Wavelet Encoding for Transmission of Images Over Vary-
`ing Channels”, IEEE Transactions on Image Processing, vol. 9, no. 6, pp. 982-993, June 2000.
`
`40. Andr´as M´ehes and Kenneth Zeger, “Source and Channel Rate Allocation for Channel Codes
`Satisfying the Gilbert-Varshamov or Tsfasman-Vlˇadut¸-Zink Bounds”, IEEE Transactions on In-
`formation Theory, vol. 46, no. 6, pp. 2133-2151, September 2000.
`
`41. Erik Agrell, Alexander Vardy, and Kenneth Zeger, “Upper Bounds for Constant-Weight
`Codes”, IEEE Transactions on Information Theory, vol. 46, no. 7, pp. 2373-2395, Novem-
`ber 2000.
`
`42. Andr´as M´ehes and Kenneth Zeger, “Performance of Quantizers on Noisy Channels using
`Structured Families of Codes”, IEEE Transactions on Information Theory, vol. 46, no. 7, pp.
`2468-2476, November 2000.
`
`43. Akiko Kato and Kenneth Zeger, “Partial Characterization of the Positive Capacity Region of
`Two-Dimensional Asymmetric Run Length Constrained Channels”, IEEE Transactions on Infor-
`mation Theory, vol. 46, no. 7, pp. 2666-2670, November 2000.
`
`44. Tam´as Linder, Ram Zamir, and Kenneth Zeger, “On Source Coding with Side Information
`Dependent Distortion Measures”, IEEE Transactions on Information Theory, vol. 46, no. 7, pp.
`2697-2704, November 2000.
`
`45. Marc Fossorier, Zixiang Xiong, and Kenneth Zeger, “Progressive Source Coding for a Power
`Constrained Gaussian Channel”, IEEE Transactions on Communications, vol. 49, no. 8, pp.
`1301-1306, August 2001.
`
`46. Erik Agrell, Alexander Vardy, and Kenneth Zeger, “A Table of Upper Bounds for Binary
`Codes”, IEEE Transactions on Information Theory, vol. 47, no. 7, pp. 3004-3006, November
`2001.
`
`47. Erik Agrell, Thomas Eriksson, Alexander Vardy, and Kenneth Zeger, “Closest Point Search
`in Lattices”, IEEE Transactions on Information Theory, vol. 48, no. 8, pp. 2201-2214, August
`2002.
`
`48. Jon Hamkins and Kenneth Zeger, “Gaussian Source Coding with Spherical Codes”, IEEE
`Transactions on Information Theory, vol. 48, no. 11, pp. 2980-2989, November 2002.
`
`49. Tam´as Frajka and Kenneth Zeger, “Residual Image Coding for Stereo Image Compression”,
`Optical Engineering, vol. 42, no. 1, pp. 182-189, January 2003.
`
`50. Christopher Freiling, Douglas Jungreis, Franc¸ois Th´eberge, and Kenneth Zeger, “Almost
`all Complete Prefix Codes have a Self-Synchronizing String”, IEEE Transactions on Information
`Theory, vol. 49, no. 9, pp. 2219-2225, September 2003.
`
`51. Zsigmond Nagy and Kenneth Zeger, “Asymptotic Capacity of Two-Dimensional Channels
`with Checkerboard Constraints”, IEEE Transactions on Information Theory, vol. 49, no. 9,
`pp. 2115-2125, September 2003.
`
`Page 9 of 21
`
`CV of K. Zeger
`
`IPR2016-01203 Ex. 2009
`Page 9 of 21
`
`

`

`January 8, 2017
`52. Tam´as Frajka and Kenneth Zeger, “Disparity Estimation Window Size”, Optical Engineering,
`vol. 42, no. 11, pp. 3334-3341, November 2003.
`
`53. Benjamin Farber and Kenneth Zeger, “Quantizers with Uniform Encoders and Channel Opti-
`mized Decoders”, IEEE Transactions on Information Theory, vol. 50, no. 1, pp. 62-77, January
`2004.
`
`54. Tam´as Frajka and Kenneth Zeger, “Downsampling Dependent Upsampling of Images”, Signal
`Processing: Image Communication, vol. 19, no. 3, pp. 257-265, March 2004.
`
`55. Michelle Effros, Hanying Feng, and Kenneth Zeger, “Suboptimality of the Karhunen-Lo`eve
`Transform for Transform Coding”, IEEE Transactions on Information Theory, vol. 50, no. 8, pp.
`1605-1619, August 2004.
`
`56. Randall Dougherty, Christopher Freiling, and Kenneth Zeger, “Linearity and Solvability in
`Multicast Networks”, IEEE Transactions on Information Theory, vol. 50, no. 10, pp. 2243-2256,
`October 2004.
`
`57. Zsigmond Nagy and Kenneth Zeger, “Bit Stuffing Algorithms and Analysis for Run Length
`Constrained Channels in Two and Three Dimensions”, IEEE Transactions on Information The-
`ory, vol. 50, no. 12, pp. 3146- 3169, December 2004.
`
`58. Randall Dougherty, Christopher Freiling, and Kenneth Zeger, “Insufficiency of Linear Cod-
`ing in Network Information Flow”, IEEE Transactions on Information Theory, vol. 51, no. 8,
`pp. 2745-2759, August 2005.
`
`59. Zsolt Kukorelly and Kenneth Zeger, “Sufficient Conditions for Existence of Binary Fix-Free
`Codes”, IEEE Transactions on Information Theory, vol. 51, no. 10, pp. 3433- 3444, October
`2005.
`
`60. Benjamin Farber and Kenneth Zeger, “Quantizers with Uniform Decoders and Channel Op-
`timized Encoders”, IEEE Transactions on Information Theory, vol. 52, no. 2, pp. 640-661,
`February 2006.
`
`61. Jillian Cannons, Randall Dougherty, Chris Freiling, and Kenneth Zeger, “Network Routing
`Capacity”, IEEE Transactions on Information Theory, vol. 52, no. 3, pp. 777-788, March 2006.
`
`62. Randall Dougherty, Chris Freiling, and Kenneth Zeger, “Unachievability of Network Coding
`Capacity”, IEEE Transactions on Information Theory & IEEE/ACM Transactions on Networking
`(joint issue), vol. 52, no. 6, pp. 2365-2372, June 2006.
`
`63. Benjamin Farber and Kenneth Zeger, “Quantization of Multiple Sources Using Nonnegative
`Integer Bit Allocation”, IEEE Transactions on Information Theory, vol. 52, no. 11, pp. 4945-
`4964, November 2006.
`
`64. Randall Dougherty and Kenneth Zeger, “Nonreversibility and Equivalent Constructions of
`Multiple-Unicast Networks”, IEEE Transactions on Information Theory, vol. 52, no. 11, pp.
`5067-5077, November 2006.
`
`Page 10 of 21
`
`CV of K. Zeger
`
`IPR2016-01203 Ex. 2009
`Page 10 of 21
`
`

`

`January 8, 2017
`
`65. Randall Dougherty, Chris Freiling, and Kenneth Zeger, “Networks, Matroids, and Non-
`Shannon Information Inequalities”, IEEE Transactions on Information Theory, vol. 53, no. 6,
`pp. 1949-1969, June 2007.
`
`66. Jillian Cannons and Kenneth Zeger, “Network Coding Capacity with a Constrained Number
`of Coding Nodes”, IEEE Transactions on Information Theory, vol. 54, no. 3, pp. 1287-1291,
`March 2008.
`
`67. Randall Dougherty, Chris Freiling, and Kenneth Zeger, “Linear Network Codes and Systems
`of Polynomial Equations”, IEEE Transactions on Information Theory, vol. 54, no. 5, pp. 2303-
`2316, May 2008.
`
`68. Jillian Cannons, Laurence Milstein, and Kenneth Zeger, “An Algorithm for Wireless Relay
`Placement”, IEEE Transactions on Wireless Communications, vol. 8, no. 11, pp. 5564-5574,
`November 2009.
`
`69. Rathinakumar Appuswamy, Massimo Franceschetti, Nikhil Karamchandani, and Kenneth
`Zeger “Network Coding for Computing: Cut-Set Bounds”, IEEE Transactions on Information
`Theory (special issue on networks), vol. 57, no. 2, pp. 1015-1030, February 2011.
`
`70. Randall Dougherty, Chris Freiling, and Kenneth Zeger, “Network Coding and Matroid The-
`ory”, Proceedings of the IEEE (special issue on network coding), invited, vol. 99, no. 3, pp.
`388-405, March 2011.
`
`71. Rathinakumar Appuswamy, Massimo Franceschetti, Nikhil Karamchandani, and Kenneth
`Zeger “Linear Codes, Target Function Classes, and Network Computing Capacity”, IEEE Trans-
`actions on Information Theory, vol. 59, no. 9, pp. 5741-5753, September 2013.
`
`72. Randall Dougherty, Chris Freiling, and Kenneth Zeger, “Achievable Rate Regions for Net-
`work Coding”, IEEE Transactions on Information Theory, vol. 61, no. 5, pp. 2488-2509, May
`2015.
`
`73. Randall Dougherty, Eric Freiling, and Kenneth Zeger, “Characteristic-Dependent Linear
`Rank Inequalities with Applications to Network Coding”, IEEE Transactions on Information
`Theory, vol. 61, no. 5, pp. 2510-2530, May 2015.
`
`74. Joseph Connelly and Kenneth Zeger, “A Class of Non-Linearly Solvable Networks”, IEEE
`Transactions on Information Theory, vol. 63, no. 1, pp. 201-229, January 2017.
`
`Book Chapter:
`
`1. Allen Gersho, Shihua Wang, and Kenneth Zeger, “Vector Quantization Techniques in Speech
`Coding”, Chapter 2 (pp. 49-84) in: Advances in Speech Signal Processing, S. Furui and M.
`Sondhi eds., Marcel Dekker Inc., 1992.
`
`Book Review:
`
`1. Kenneth Zeger and Eve A. Riskin, review of: “Vector Quantization” by Huseyin Abut (IEEE
`Press 1990), IEEE Information Theory Society Newsletter, December 1992.
`
`Page 11 of 21
`
`CV of K. Zeger
`
`IPR2016-01203 Ex. 2009
`Page 11 of 21
`
`

`

`Conference Papers:
`
`January 8, 2017
`
`1. Fredrick Kitson and Kenneth Zeger, “A Real-Time ADPCM Encoder using Variable Order
`Linear Prediction”, Proceedings IEEE International Conference on Acoust., Speech, and Sig.
`Processing (ICASSP), Tokyo, Japan, pp. 825-828, May 1986.
`
`2. Juin-Hwey Chen, Grant Davidson, Allen Gersho, and Kenneth Zeger, “Speech Coding for
`the Mobile Satellite Experiment”, (invited paper), special session on Mobile Satellite Commu-
`nications, Proceedings IEEE International Conference on Communications (ICC), pp 756-763,
`June 1987, Seattle, Washington.
`
`3. Kenneth Zeger and Allen Gersho, “Real-Time Vector Predictive Coding of Speech”, (invited
`paper), Proceedings IEEE International Conference on Communications (ICC), pp 1147-1152,
`June 1987, Seattle, Washington.
`
`4. Kenneth Zeger and Allen Gersho, “Vector Quantizer Design for Memoryless Noisy Channels”,
`Processing IEEE International Conference on Communications (ICC), Philadelphia, Pennsylva-
`nia, pp. 1593-1597, June 1988.
`
`5. Kenneth Zeger, Erdal Paksoy, and Allen Gersho, “Source/Channel Coding for Vector Quantiz-
`ers by Index Assignment Permutations”, IEEE International Symposium on Information Theory
`(ISIT), pp. 78-79, San Diego, California, January 1990.
`
`6. Eyal Yair, Kenneth Zeger, and Allen Gersho, “Conjugate Gradient Methods For Designing
`Vector Quantizers”, Proceedings IEEE International Conference on Acoustics, Speech, and Sig-
`nal Processing (ICASSP), Albuquerque, New Mexico, pp. 245-248, May 1990.
`
`7. Ashok Popat and Kenneth Zeger, “Robust Quantization of Memoryless Sources”, International
`Symposium on Information Theory and its Applications (ISITA), Honolulu, Hawaii, pp. 507-510,
`November 1990.
`
`8. Eyal Yair and Kenneth Zeger, “A Method to Obtain Better Codebooks for Vector Quantizers
`than those Achieved by the Generalized Lloyd Algorithm”, Proceedings of the 17th Israel IEEE
`Convention, Tel Aviv, Israel, pp. 191-194, March 1991.
`
`9. Kenneth Zeger and Allen Gersho, “A Parallel Processing Algorithm for Vector Quantizer
`Design Based on Subpartitioning”, Proceedings IEEE International Conference on Acoustics,
`Speech, and Signal Processing (ICASSP), Toronto, Canada, pp. 1141-1143, May 1991.
`
`10. Kenneth Zeger and Gopal Krishna, “Bi-level Facsimile Compression With Unconstrained
`Tilings”, Proceedings of the Third International Conference on Advances in Communicationss
`and Control Systems (COMCON) Victoria, Canada, pp. 853-864, October 1991.
`
`11. Kenneth Zeger and Miriam R. Kantorovitz, “Average Number of Facets per Cell in Tree-
`Structured Euclidean Partitions”, International Symposium on Information Theory and its Appli-
`cations (ISITA), Ibusuki, Japan, pp. 573-576, December 1991.
`
`Page 12 of 21
`
`CV of K. Zeger
`
`IPR2016-01203 Ex. 2009
`Page 12 of 21
`
`

`

`January 8, 2017
`
`12. Kenneth Zeger and Victor Manzella, “Asymptotic Noisy Channel Vector Quantization Via
`Random Coding”, International Symposium on Information Theory and its Applications (ISITA),
`Ibusuki, Japan, pp. 577-580, December 1991.
`
`13. Kenneth Zeger and Anurag Bist, “Universal Adaptive Vector Quantization with Application
`to Image Compression”, Proceedings IEEE International Conference on Acoustics, Speech, and
`Signal Processing (ICASSP), San Francisco, California, pp. 381-384, March 1992.
`
`14. Kenneth Zeger, “Asymptotic Analysis of Zero Delay Source-Channel Coding”, IEEE Commu-
`nication Theory Workshop, Port Ludlow, Washington, June 1992 (invited paper).
`
`15. Kenneth Zeger and Vic Manzella, “Asymptotically Optimal Noisy Channel Quantization Via
`Random Coding”, Joint DIMACS/IEEE Workshop on Coding and Quantization, Rutgers Univer-
`sity, Piscataway, NJ, October 1992.
`
`16. Tam´as Linder and Kenneth Zeger, “Asymptotic Entropy Constrained Performance of Tes-
`sellating and Universal Randomized Lattice Quantization”, IEEE International Symposium on
`Information Theory (ISIT), San Antonio, Texas, pg. 390, January 1993.
`
`17. Kenneth Zeger and Miriam R. Kantorovitz, “Average Number of Facets per Cell in Tree-
`Structured Vector Quantizer Partitions”, IEEE International Symposium on Information Theory
`(ISIT), San Antonio, Texas, pg. 393, January 1993.
`
`18. Tam´as Linder, Christian Schlegel, and Kenneth Zeger, “Correction and Interpretation of de
`Buda’s Theorem”, IEEE International Symposium on Information Theory (ISIT), San Antonio,
`Texas, pg. 65, January 1993.
`
`19. Tam´as Linder, G´abor Lugosi, and Kenneth Zeger, “Universality and Rates of Convergence in
`Lossy Source Coding”, Data Compression Conference (DCC), Salt Lake City, Utah, pp. 89-97,
`April 1993.
`
`20. Andr´as M´ehes and Kenneth Zeger, “Redundancy Free Codes for Arbitrary Memoryless Bi-
`nary Channels” 28th Annual Conference on Information Sciences and Systems (CISS), Princeton
`University, New Jersey, pp. 1057-1062, March 1994.
`
`21. G´abor Lugosi and Kenneth Zeger, “Nonparametric Estimation using Neural Networks”, IEEE
`International Symposium on Information Theory (ISIT), Trondheim, Norway, pg. 112, June 1994.
`
`22. Tam´as Linder, G´abor Lugosi, and Kenneth Zeger, “Rates of Convergence in the Source Cod-
`ing Theorem, in Empirical Quantizer Design, and in Universal Lossy Source Coding”, IEEE In-
`ternational Symposium on Information Theory (ISIT), Trondheim, Norway, pg. 454, June 1994.
`
`23. Tam´as Linder, G´abor Lugosi, and Kenneth Zeger, “Fixed Rate Universal Lossy Source Cod-
`ing for Memoryless Sources and Rates of Convergence”, IEEE International Symposium on In-
`formation Theory (ISIT), Trondheim, Norway, pg. 453, June 1994.
`
`24. Kenneth Zeger and Allen Gersho, “How Many Points in Euclidean Space can have a Common
`Nearest Neighbor ?”, IEEE International Symposium on Information Theory (ISIT), Trondheim,
`Norway, pg. 109, June 1994.
`
`Page 13 of 21
`
`CV of K. Zeger
`
`IPR2016-01203 Ex. 2009
`Page 13 of 21
`
`

`

`January 8, 2017
`25. G´abor Lugosi and Kenneth Zeger, “Concept Learning using Complexity Regularization”, IEEE
`Workshop on Information Theory, Rydzyna, Poland, June 1995 (invited).
`
`26. Andr´as M´ehes and Kenneth Zeger, “On the Performance of Affine Index Assignments for
`Redundancy Free Source-Channel Coding”, Data Compression Conference (DCC), Salt Lake
`City, Utah, pg. 433, April 1995.
`
`27. Jon Hamkins and Kenneth Zeger, “Asymptotically Optimal Spherical Codes”, 29th Annual
`Conference on Information Sciences and Systems (CISS), Johns Hopkins University, Maryland,
`pp. 52-57, March 1995.
`
`28. Jon Hamkins and Kenneth Zeger, “Asymptotically Optimal Spherical Code Construction”,
`IEEE International Symposium on Information Theory (ISIT), British Columbia, Canada, pg.
`184, September 1995.
`
`29. Tam´as Linder and Kenneth Zeger, “On the Cost of Finite Block Length in Quantizing Un-
`bounded Memoryless Sources”, IEEE International Symposium on Information Theory (ISIT),
`British Columbia, Canada, pg. 370, September 1995.
`
`30. G´abor Lugosi and Kenneth Zeger, “Concept Learning using Complexity Regularization”, IEEE
`International Symposium on Information Theory (ISIT), British Columbia, Canada, 229, Septem-
`ber 1995.
`
`31. Andr´as M´ehes and Kenneth Zeger, “Affine Index Assignments for Binary Lattice Quantiza-
`tion with Channel Noise”, IEEE International Symposium on Information Theory (ISIT), British
`Columbia, Canada, pg. 377, September 1995.
`
`32. Tam´as Linder, G´abor Lugosi, and Kenneth Zeger, “Designing Vector Quantizers in the Pres-
`ence of Source Noise or Channel Noise”, Data Compression Conference (DCC), Salt Lake City,
`Utah, pp. 33-42, April 1996.
`
`33. Jon Hamkins and Kenneth Zeger, “Wrapped Spherical Codes”, 30th Annual Conference on
`Information Sciences and Systems (CISS), Princeton University, New Jersey, pp. 290-295, March
`1996.
`
`34. Vahid Tarokh, Alexander Vardy, and Kenneth Zeger, “On The Performance of Lattice Codes”,
`30th Annual Conference on Information Sciences and Systems (CISS), Princeton University, New
`Jersey, pp. 300-305, March 1996.
`
`35. Kenneth Zeger, “Recent Problems in Lossy Source Coding: Theory and Practice”, IEEE Com-
`munication Theory Workshop, Destin, Florida, April 1996 (invited plenary speaker).
`
`36. Bertrand Hochwald and Kenneth Zeger, “Bounds on the Tradeoff between Source and Chan-
`nel Coding with a Delay Constraint”, International Symposium on Information Theory and its
`Applications (ISITA), Victoria, Canada, pp. 755-758, October 1996.
`
`37. Shawn Herman and Kenneth Zeger, “Progressive Source Coding for Variable Rates on a
`Packet Network”, International Symposium on Information Theory and its Applications (ISITA),
`Victoria, Canada, pp. 417-420, October 1996.
`
`Page 14 of 21
`
`CV of K. Zeger
`
`IPR2016-01203 Ex. 2009
`Page 14 of 21
`
`

`

`January 8, 2017
`
`38. Vahid Tarokh, Alexander Vardy, and Kenneth Zeger, “Sequential Decoding of Lattices”,
`International Symposium on Information Theory and its Applications (ISITA), Victoria, Canada,
`pp. 1-4, October 1996.
`
`39. Tam´as Linder, Vahid Tarokh, and Kenneth Zeger, “Existence of Optimal Codes for Infinite
`Source Alphabets”, Allerton Conference on Communication, Control, and Computing, Allerton
`Park, Illinois, pp. 62-65, October 1996.
`
`40. P. Greg Sherwood and Kenneth Zeger, “Progressive Image Coding on Noisy Channels”, Data
`Compression Conference (DCC), Salt Lake City, Utah, pp. 72-81, March 1997.
`
`41. Tam´as Linder, Ram Zamir, and Kenneth Zeger, “Multidimensional Companding for Non-
`difference Distortion Measures”, 31st Annual Conference on Information Sciences and Systems
`(CISS), Johns Hopkins University, Maryland, pp. 132-137, March 1997.
`
`42. Andr´as M´ehes and Kenneth Zeger, “Tradeoff Between Source and Channel Coding for Codes
`Satisfying the Gilbert-Varshamov Bound”, 31st Annual Conference on Information Sciences and
`Systems (CISS), Johns Hopkins University, Maryland, pp. 314-318, March 1997.
`
`43. Bertrand Hochwald and Kenneth Zeger, “Tradeoff Between Source and Channel Coding”,
`IEEE International Symposium on Information Theory (ISIT), Ulm, Germany, pg. 335, July
`1997.
`
`44. Jon Hamkins and Kenneth Zeger, “Improved Bounds on Maximum Size Binary Radar Arrays”,
`IEEE International Symposium on Information Theory (ISIT), Ulm, Germany, pg. 518, July 1997.
`
`45. Jon Hamkins and Kenneth Zeger, “Structured Spherical Codes for Gaussian Quantization”,
`IEEE International Symposium on Information Theory (ISIT), Ulm, Germany, pg. 62, July 1997.
`
`46. Vahid Tarokh, Alexander Vardy, and Kenneth Zeger, “Sequential Decoding of Lattice Codes”,
`IEEE International Symposium on Information Theory (ISIT), Ulm, Germany, pg. 497, July 1997.
`
`47. Tam´as Lind