Conjugate gradient methods for designing vector quantizers. - Eyal Yair; Kenneth Zeger; Allen Gersho (ICASSP, 1990)

Pseudo-Gray coding. - Kenneth Zeger; Allen Gersho (IEEE Trans. Commun., 1990)

Efficient Solution to Some Problems in Free Partially Commutative Monoids - Hai-Ning Liu; Celia Wrathall; Kenneth Zeger (Inf. Comput., 1990)

A parallel processing algorithm for vector quantizer design based on subpartitioning. - Kenneth Zeger; Allen Gersho (ICASSP, 1991)

Corrections to 'Gradient algorithms for designing predictive vector quantizers'. - Kenneth Zeger (IEEE Trans. Signal Process., 1991)

Universal adaptive vector quantization using codebook quantization with application to image compression. - Kenneth Zeger; Anurag Bist (ICASSP, 1992)

Robust quantization of memoryless sources using dispersive FIR filters. - Kris Popat; Kenneth Zeger (IEEE Trans. Commun., 1992)

Competitive learning and soft competition for vector quantizer design. - Eyal Yair; Kenneth Zeger; Allen Gersho (IEEE Trans. Signal Process., 1992)

Globally optimal vector quantizer design by stochastic relaxation. - Kenneth Zeger; Jacques Vaisey; Allen Gersho (IEEE Trans. Signal Process., 1992)

Universality and Rates of Convergence in Lossy Source Coding. - Tamás Linder; Gábor Lugosi; Kenneth Zeger (Data Compression Conference, 1993)

Corrected proof of de Buda's theorem. - Tamás Linder; Christian Schlegel; Kenneth Zeger (IEEE Trans. Inf. Theory, 1993)

Average number of facets per cell in tree-structured vector quantizer partitions. - Kenneth Zeger; Miriam R. Kantorovitz (IEEE Trans. Inf. Theory, 1993)

Universal source coding with codebook transmission. - Kenneth Zeger; Anurag Bist; Tamás Linder (IEEE Trans. Commun., 1994)

Rates of convergence in the source coding theorem, in empirical quantizer design, and in universal lossy source coding. - Tamás Linder; Gábor Lugosi; Kenneth Zeger (IEEE Trans. Inf. Theory, 1994)

Asymptotic entropy-constrained performance of tessellating and universal randomized lattice quantization. - Tamás Linder; Kenneth Zeger (IEEE Trans. Inf. Theory, 1994)

Number of nearest neighbors in a Euclidean code. - Kenneth Zeger; Allen Gersho (IEEE Trans. Inf. Theory, 1994)

Asymptotic bounds on optimal noisy channel optimization via random coding. - Kenneth Zeger; V. Manzella (IEEE Trans. Inf. Theory, 1994)

Fixed-rate universal lossy source coding and rates of convergence for memoryless sources. - Tamás Linder; Gábor Lugosi; Kenneth Zeger (IEEE Trans. Inf. Theory, 1995)

Nonparametric estimation via empirical risk minimization. - Gábor Lugosi; Kenneth Zeger (IEEE Trans. Inf. Theory, 1995)

Designing Vector Quantizers in the Presence of Source Noise or Channel Noise. - Tamás Linder; Gábor Lugosi; Kenneth Zeger (Data Compression Conference, 1996)

On the cost of finite block length in quantizing unbounded memoryless sources. - Tamás Linder; Kenneth Zeger (IEEE Trans. Inf. Theory, 1996)

Concept learning using complexity regularization. - Gábor Lugosi; Kenneth Zeger (IEEE Trans. Inf. Theory, 1996)

Progressive Image Coding with Spatially Variable Resolution. - Tamás Frajka; P. Greg Sherwood; Kenneth Zeger (ICIP (1), 1997)

Progressive image coding for noisy channels. - P. Greg Sherwood; Kenneth Zeger (IEEE Signal Process. Lett., 1997)

Improved bounds on maximum size binary radar arrays. - Jon Hamkins; Kenneth Zeger (IEEE Trans. Inf. Theory, 1997)

Asymptotically dense spherical codes - Part h Wrapped spherical codes. - Jon Hamkins; Kenneth Zeger (IEEE Trans. Inf. Theory, 1997)

Asymptotically dense spherical codes - Part II: Laminated spherical codes. - Jon Hamkins; Kenneth Zeger (IEEE Trans. Inf. Theory, 1997)

Tradeoff between source and channel coding. - Bertrand M. Hochwald; Kenneth Zeger (IEEE Trans. Inf. Theory, 1997)

Empirical quantizer design in the presence of source noise or channel noise. - Tamás Linder; Gábor Lugosi; Kenneth Zeger (IEEE Trans. Inf. Theory, 1997)

Existence of optimal prefix codes for infinite source alphabets. - Tamás Linder; Vahid Tarokh; Kenneth Zeger (IEEE Trans. Inf. Theory, 1997)

The Multiple Description Rate Region for High Resolution Source Coding. - Tamás Linder; Ram Zamir; Kenneth Zeger (Data Compression Conference, 1998)

Image Compression for Memory Constrained Printers. - Pamela C. Cosman; Tamás Frajka; Kenneth Zeger (ICIP (3), 1998)

Joint Source-Channel Image Coding for a Power Constrained Noisy Channel. - Marc P. C. Fossorier; Zixiang Xiong; Kenneth Zeger (ICIP (2), 1998)

A Polygonal Line Algorithm for Constructing Principal Curves. - Balázs Kégl; Adam Krzyzak; Tamás Linder; Kenneth Zeger (NIPS, 1998)

Memory constrained wavelet based image coding. - Pamela C. Cosman; Kenneth Zeger (IEEE Signal Process. Lett., 1998)

Error protection for progressive image transmission over memoryless and fading channels. - P. Greg Sherwood; Kenneth Zeger (IEEE Trans. Commun., 1998)

Binary Lattice Vector Quantization with Linear Block Codes and Affine Index Assignments. - András Méhes; Kenneth Zeger (IEEE Trans. Inf. Theory, 1998)

Capacity Bounds for the 3-Dimensional (0, 1) Runlength Limited Channel. - Zsigmond Nagy; Kenneth Zeger (AAECC, 1999)

Channel code blocklength and rate optimization for progressive image transmission. - P. Greg Sherwood; Xiaodong Tian; Kenneth Zeger (WCNC, 1999)

Zero Capacity Region of Multidimensional Run Length Constraints. - Hisashi Ito; Akiko Kato; Zsigmond Nagy; Kenneth Zeger (Electron. J. Comb., 1999)

On the rate-distortion function of random vectors and stationary sources with mixed distributions. - András György 001; Tamás Linder; Kenneth Zeger (IEEE Trans. Inf. Theory, 1999)

On the capacity of two-dimensional run-length constrained channels. - Akiko Kato; Kenneth Zeger (IEEE Trans. Inf. Theory, 1999)

High-Resolution Source Coding for Non-Difference Distortion Measures: Multidimensional Companding. - Tamás Linder; Ram Zamir; Kenneth Zeger (IEEE Trans. Inf. Theory, 1999)

Randomly Chosen Index Assignments Are Asymptotically Bad for Uniform Sources. - András Méhes; Kenneth Zeger (IEEE Trans. Inf. Theory, 1999)

Universal Bound on the Performance of Lattice Codes. - Vahid Tarokh; Alexander Vardy; Kenneth Zeger (IEEE Trans. Inf. Theory, 1999)

Efficient Image and Channel Coding for Wireless Packet Networks. - P. Greg Sherwood; Xiaodong Tian; Kenneth Zeger (ICIP, 2000)

Learning and Design of Principal Curves. - Balázs Kégl; Adam Krzyzak; Tamás Linder; Kenneth Zeger (IEEE Trans. Pattern Anal. Mach. Intell., 2000)

Combined forward error control and packetized zerotree wavelet encoding for transmission of images over varying channels. - Pamela C. Cosman; Jon K. Rogers; P. Greg Sherwood; Kenneth Zeger (IEEE Trans. Image Process., 2000)

Upper bounds for constant-weight codes. - Erik Agrell; Alexander Vardy; Kenneth Zeger (IEEE Trans. Inf. Theory, 2000)

Partial characterization of the positive capacity region of two-dimensional asymmetric run length constrained channels. - Akiko Kato; Kenneth Zeger (IEEE Trans. Inf. Theory, 2000)

On source coding with side-information-dependent distortion measures. - Tamás Linder; Ram Zamir; Kenneth Zeger (IEEE Trans. Inf. Theory, 2000)

Source and channel rate allocation for channel codes satisfying the Gilbert-Varshamov or Tsfasman-Vladut-Zink bounds. - András Méhes; Kenneth Zeger (IEEE Trans. Inf. Theory, 2000)

Performance of quantizers on noisy channels using structured families of codes. - András Méhes; Kenneth Zeger (IEEE Trans. Inf. Theory, 2000)

Capacity bounds for the three-dimensional (0, 1) run length limited channel. - Zsigmond Nagy; Kenneth Zeger (IEEE Trans. Inf. Theory, 2000)

Robust packet image transmission by wavelet coefficient dispersement. - Tamás Frajka; Kenneth Zeger (ICASSP, 2001)

Progressive source coding for a power constrained Gaussian channel. - Marc P. C. Fossorier; Zixiang Xiong; Kenneth Zeger (IEEE Trans. Commun., 2001)

A table of upper bounds for binary codes. - Erik Agrell; Alexander Vardy; Kenneth Zeger (IEEE Trans. Inf. Theory, 2001)

Suboptimality of the Karhunen-Loeve transform for fixed-rate transform coding. - Kenneth Zeger (GLOBECOM, 2002)

Residual image coding for stereo image compression. - Tamás Frajka; Kenneth Zeger (ICIP (2), 2002)

Closest point search in lattices. - Erik Agrell; Thomas Eriksson; Alexander Vardy; Kenneth Zeger (IEEE Trans. Inf. Theory, 2002)

Gaussian source coding with spherical codes. - Jon Hamkins; Kenneth Zeger (IEEE Trans. Inf. Theory, 2002)

Suboptimality of the Karhuenen-Loève Transform for Transform Coding. - Michelle Effros; Hanying Feng; Kenneth Zeger (DCC, 2003)

Almost all complete binary prefix codes have a self-synchronizing string. - Christopher F. Freiling; Douglas S. Jungreis; François Théberge; Kenneth Zeger (IEEE Trans. Inf. Theory, 2003)

Asymptotic capacity of two-dimensional channels with checkerboard constraints. - Zsigmond Nagy; Kenneth Zeger (IEEE Trans. Inf. Theory, 2003)

Cell density functions and effective channel code rates for quantizers with uniform decoders and channel optimized encoders. - Benjamin Farber; Kenneth Zeger (ISIT, 2004)

Capacity bounds for the hard-triangle model. - Zsigmond Nagy; Kenneth Zeger (ISIT, 2004)

Downsampling dependent upsampling of images. - Tamás Frajka; Kenneth Zeger (Signal Process. Image Commun., 2004)

Linearity and solvability in multicast networks. - Randall Dougherty; Christopher F. Freiling; Kenneth Zeger (IEEE Trans. Inf. Theory, 2004)

Suboptimality of the Karhunen-Loève Transform for Transform Coding. - Michelle Effros; Hanying Feng; Kenneth Zeger (IEEE Trans. Inf. Theory, 2004)

Quantizers with uniform encoders and channel optimized decoders. - Benjamin Farber; Kenneth Zeger (IEEE Trans. Inf. Theory, 2004)

Bit-stuffing algorithms and analysis for run-length constrained channels in two and three dimensions. - Zsigmond Nagy; Kenneth Zeger (IEEE Trans. Inf. Theory, 2004)

Quantization of Multiple Sources Using Integer Bit Allocation. - Benjamin Farber; Kenneth Zeger (DCC, 2005)

Insufficiency of linear coding in network information flow. - Randall Dougherty; Christopher F. Freiling; Kenneth Zeger (IEEE Trans. Inf. Theory, 2005)

Sufficient conditions for existence of binary fix-free codes. - Zsolt Kukorelly; Kenneth Zeger (IEEE Trans. Inf. Theory, 2005)

Optimality of Linear Codes for Broadcast-Mode Multicast Networks. - Rathinakumar Appuswamy; Massimo Franceschetti; Kenneth Zeger (ISIT, 2006)

Six New Non-Shannon Information Inequalities. - Randall Dougherty; Christopher F. Freiling; Kenneth Zeger (ISIT, 2006)

Automated Theorem Proving for Hexagonal Run Length Constrained Capacity Computation. - Zsolt Kukorelly; Kenneth Zeger (ISIT, 2006)

Network routing capacity. - Jillian Cannons; Randall Dougherty; Christopher F. Freiling; Kenneth Zeger (IEEE Trans. Inf. Theory, 2006)

Unachievability of network coding capacity. - Randall Dougherty; Christopher F. Freiling; Kenneth Zeger (IEEE Trans. Inf. Theory, 2006)

Nonreversibility and Equivalent Constructions of Multiple-Unicast Networks. - Randall Dougherty; Kenneth Zeger (IEEE Trans. Inf. Theory, 2006)

Quantizers with uniform decoders and channel-optimized encoders. - Benjamin Farber; Kenneth Zeger (IEEE Trans. Inf. Theory, 2006)

Quantization of Multiple Sources Using Nonnegative Integer Bit Allocation. - Benjamin Farber; Kenneth Zeger (IEEE Trans. Inf. Theory, 2006)

Networks, Matroids, and Non-Shannon Information Inequalities. - Randall Dougherty; Christopher F. Freiling; Kenneth Zeger (IEEE Trans. Inf. Theory, 2007)

Network coding for computing. - Rathinakumar Appuswamy; Massimo Franceschetti; Nikhil Karamchandani; Kenneth Zeger (Allerton, 2008)

Network Coding Capacity With a Constrained Number of Coding Nodes. - Jillian Cannons; Kenneth Zeger (IEEE Trans. Inf. Theory, 2008)

Linear Network Codes and Systems of Polynomial Equations. - Randall Dougherty; Christopher F. Freiling; Kenneth Zeger (IEEE Trans. Inf. Theory, 2008)

Network computing capacity for the reverse butterfly network. - Rathinakumar Appuswamy; Massimo Franceschetti; Nikhil Karamchandani; Kenneth Zeger (ISIT, 2009)

Linear rank inequalities on five or more variables - Randall Dougherty; Christopher F. Freiling; Kenneth Zeger (CoRR, 2009)

Network Coding for Computing Part I : Cut-Set Bounds - Rathinakumar Appuswamy; Massimo Franceschetti; Nikhil Karamchandani; Kenneth Zeger (CoRR, 2009)

An algorithm for wireless relay placement. - Jillian Cannons; Laurence B. Milstein; Kenneth Zeger (IEEE Trans. Wirel. Commun., 2009)

Linear coding for network computing. - Rathinakumar Appuswamy; Massimo Franceschetti; Nikhil Karamchandani; Kenneth Zeger (ISIT, 2011)

Network coding for computing: Linear codes - Rathinakumar Appuswamy; Massimo Franceschetti; Nikhil Karamchandani; Kenneth Zeger (CoRR, 2011)

Non-Shannon Information Inequalities in Four Random Variables - Randall Dougherty; Christopher F. Freiling; Kenneth Zeger (CoRR, 2011)

Network Coding and Matroid Theory. - Randall Dougherty; Christopher F. Freiling; Kenneth Zeger (Proc. IEEE, 2011)

Network Coding for Computing: Cut-Set Bounds. - Rathinakumar Appuswamy; Massimo Franceschetti; Nikhil Karamchandani; Kenneth Zeger (IEEE Trans. Inf. Theory, 2011)

Linear Codes, Target Function Classes, and Network Computing Capacity. - Rathinakumar Appuswamy; Massimo Franceschetti; Nikhil Karamchandani; Kenneth Zeger (IEEE Trans. Inf. Theory, 2013)

Characteristic-dependent linear rank inequalities and network coding applications. - Randall Dougherty; Eric Freiling; Kenneth Zeger (ISIT, 2014)

Achievable Rate Regions for Network Coding. - Randall Dougherty; Christopher F. Freiling; Kenneth Zeger (IEEE Trans. Inf. Theory, 2015)

Characteristic-Dependent Linear Rank Inequalities With Applications to Network Coding. - Randall Dougherty; Eric Freiling; Kenneth Zeger (IEEE Trans. Inf. Theory, 2015)

Linear Capacity of Networks over Ring Alphabets. - Joseph Connelly; Kenneth Zeger (CoRR, 2017)

A Class of Non-Linearly Solvable Networks. - Joseph Connelly; Kenneth Zeger (IEEE Trans. Inf. Theory, 2017)

Linear Network Coding Over Rings - Part I: Scalar Codes and Commutative Alphabets. - Joseph Connelly; Kenneth Zeger (IEEE Trans. Inf. Theory, 2018)

Linear Network Coding Over Rings - Part II: Vector Codes and Non-Commutative Alphabets. - Joseph Connelly; Kenneth Zeger (IEEE Trans. Inf. Theory, 2018)

Capacity and Achievable Rate Regions for Linear Network Coding Over Ring Alphabets. - Joseph Connelly; Kenneth Zeger (IEEE Trans. Inf. Theory, 2019)

Hexagonal Run-Length Zero Capacity Region - Part I: Analytical Proofs. - Spencer Congero; Kenneth Zeger (IEEE Trans. Inf. Theory, 2022)

Hexagonal Run-Length Zero Capacity Region - Part II: Automated Proofs. - Spencer Congero; Kenneth Zeger (IEEE Trans. Inf. Theory, 2022)

Characterizations of Minimal Expected Length Codes. - Spencer Congero; Kenneth Zeger (CoRR, 2023)

The 3/4 Conjecture for Fix-Free Codes With at Most Three Distinct Codeword Lengths. - Spencer Congero; Kenneth Zeger (IEEE Trans. Inf. Theory, 2023)

Competitive Advantage of Huffman and Shannon-Fano Codes. - Spencer Congero; Kenneth Zeger (IEEE Trans. Inf. Theory, 2024)