Kenneth Zeger

IEEE Trans. Inf. Theory, March, 2023

Competitive Advantage of Huffman and Shannon-Fano Codes.

[BibT_eX]

[DOI]

CoRR, 2023

Characterizations of Minimal Expected Length Codes.

[BibT_eX]

[DOI]

CoRR, 2023

2022

Hexagonal Run-Length Zero Capacity Region - Part II: Automated Proofs.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Hexagonal Run-Length Zero Capacity Region - Part I: Analytical Proofs.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

2019

Capacity and Achievable Rate Regions for Linear Network Coding Over Ring Alphabets.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

2018

Linear Network Coding Over Rings - Part II: Vector Codes and Non-Commutative Alphabets.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Linear Network Coding Over Rings - Part I: Scalar Codes and Commutative Alphabets.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

2017

A Class of Non-Linearly Solvable Networks.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Linear Capacity of Networks over Ring Alphabets.

[BibT_eX]

[DOI]

CoRR, 2017

2015

Characteristic-Dependent Linear Rank Inequalities With Applications to Network Coding.

[BibT_eX]

[DOI]

Eric Freiling

IEEE Trans. Inf. Theory, 2015

Achievable Rate Regions for Network Coding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

2014

Characteristic-dependent linear rank inequalities and network coding applications.

[BibT_eX]

[DOI]

Eric Freiling

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013

Linear Codes, Target Function Classes, and Network Computing Capacity.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

2011

Network Coding for Computing: Cut-Set Bounds.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

Network Coding and Matroid Theory.

[BibT_eX]

[DOI]

Proc. IEEE, 2011

Non-Shannon Information Inequalities in Four Random Variables

[BibT_eX]

[DOI]

CoRR, 2011

Network coding for computing: Linear codes

[BibT_eX]

[DOI]

CoRR, 2011

Linear coding for network computing.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2009

An algorithm for wireless relay placement.

[BibT_eX]

[DOI]

Jillian Cannons

Laurence B. Milstein

IEEE Trans. Wirel. Commun., 2009

Network Coding for Computing Part I : Cut-Set Bounds

[BibT_eX]

[DOI]

CoRR, 2009

Linear rank inequalities on five or more variables

[BibT_eX]

[DOI]

CoRR, 2009

Network computing capacity for the reverse butterfly network.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

2008

Linear Network Codes and Systems of Polynomial Equations.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2008

Network Coding Capacity With a Constrained Number of Coding Nodes.

[BibT_eX]

[DOI]

Jillian Cannons

IEEE Trans. Inf. Theory, 2008

Network coding for computing.

[BibT_eX]

[DOI]

Proceedings of the 46th Annual Allerton Conference on Communication, 2008

2007

Networks, Matroids, and Non-Shannon Information Inequalities.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2007

2006

Quantization of Multiple Sources Using Nonnegative Integer Bit Allocation.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2006

Quantizers with uniform decoders and channel-optimized encoders.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2006

Nonreversibility and Equivalent Constructions of Multiple-Unicast Networks.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2006

Unachievability of network coding capacity.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2006

Network routing capacity.

[BibT_eX]

[DOI]

Jillian Cannons

IEEE Trans. Inf. Theory, 2006

Automated Theorem Proving for Hexagonal Run Length Constrained Capacity Computation.

[BibT_eX]

[DOI]

Zsolt Kukorelly

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Six New Non-Shannon Information Inequalities.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Optimality of Linear Codes for Broadcast-Mode Multicast Networks.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005

Sufficient conditions for existence of binary fix-free codes.

[BibT_eX]

[DOI]

Zsolt Kukorelly

IEEE Trans. Inf. Theory, 2005

Insufficiency of linear coding in network information flow.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2005

Quantization of Multiple Sources Using Integer Bit Allocation.

[BibT_eX]

[DOI]

Proceedings of the 2005 Data Compression Conference (DCC 2005), 2005

2004

Bit-stuffing algorithms and analysis for run-length constrained channels in two and three dimensions.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

Quantizers with uniform encoders and channel optimized decoders.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

Suboptimality of the Karhunen-Loève Transform for Transform Coding.

[BibT_eX]

[DOI]

Michelle Effros

Hanying Feng

IEEE Trans. Inf. Theory, 2004

Linearity and solvability in multicast networks.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

Downsampling dependent upsampling of images.

[BibT_eX]

[DOI]

Signal Process. Image Commun., 2004

Capacity bounds for the hard-triangle model.

[BibT_eX]

[DOI]

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Cell density functions and effective channel code rates for quantizers with uniform decoders and channel optimized encoders.

[BibT_eX]

[DOI]

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003

Asymptotic capacity of two-dimensional channels with checkerboard constraints.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2003

Almost all complete binary prefix codes have a self-synchronizing string.

[BibT_eX]

[DOI]

Douglas S. Jungreis

François Théberge

IEEE Trans. Inf. Theory, 2003

Suboptimality of the Karhuenen-Loève Transform for Transform Coding.

[BibT_eX]

[DOI]

Michelle Effros

Hanying Feng

Proceedings of the 2003 Data Compression Conference (DCC 2003), 2003

2002

Gaussian source coding with spherical codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2002

Closest point search in lattices.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2002

Residual image coding for stereo image compression.

[BibT_eX]

[DOI]

Proceedings of the 2002 International Conference on Image Processing, 2002

Suboptimality of the Karhunen-Loeve transform for fixed-rate transform coding.

[BibT_eX]

[DOI]

Proceedings of the Global Telecommunications Conference, 2002

2001

A table of upper bounds for binary codes.

[BibT_eX]

[DOI]

Erik Agrell

Alexander Vardy

IEEE Trans. Inf. Theory, 2001

Progressive source coding for a power constrained Gaussian channel.

[BibT_eX]

[DOI]

Marc P. C. Fossorier

Zixiang Xiong

IEEE Trans. Commun., 2001

Robust packet image transmission by wavelet coefficient dispersement.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Acoustics, 2001

2000

Capacity bounds for the three-dimensional (0, 1) run length limited channel.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2000

Performance of quantizers on noisy channels using structured families of codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2000

Source and channel rate allocation for channel codes satisfying the Gilbert-Varshamov or Tsfasman-Vladut-Zink bounds.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2000

On source coding with side-information-dependent distortion measures.

[BibT_eX]

[DOI]

Ram Zamir

IEEE Trans. Inf. Theory, 2000

Partial characterization of the positive capacity region of two-dimensional asymmetric run length constrained channels.

[BibT_eX]

[DOI]

Akiko Kato

IEEE Trans. Inf. Theory, 2000

Upper bounds for constant-weight codes.

[BibT_eX]

[DOI]

Erik Agrell

Alexander Vardy

IEEE Trans. Inf. Theory, 2000

Combined forward error control and packetized zerotree wavelet encoding for transmission of images over varying channels.

[BibT_eX]

[DOI]

IEEE Trans. Image Process., 2000

Learning and Design of Principal Curves.

[BibT_eX]

[DOI]

IEEE Trans. Pattern Anal. Mach. Intell., 2000

Efficient Image and Channel Coding for Wireless Packet Networks.

[BibT_eX]

[DOI]

Xiaodong Tian

Proceedings of the 2000 International Conference on Image Processing, 2000

1999

Universal Bound on the Performance of Lattice Codes.

[BibT_eX]

[DOI]

Vahid Tarokh

Alexander Vardy

IEEE Trans. Inf. Theory, 1999

Randomly Chosen Index Assignments Are Asymptotically Bad for Uniform Sources.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1999

High-Resolution Source Coding for Non-Difference Distortion Measures: Multidimensional Companding.

[BibT_eX]

[DOI]

Ram Zamir

IEEE Trans. Inf. Theory, 1999

On the capacity of two-dimensional run-length constrained channels.

[BibT_eX]

[DOI]

Akiko Kato

IEEE Trans. Inf. Theory, 1999

On the rate-distortion function of random vectors and stationary sources with mixed distributions.

[BibT_eX]

[DOI]

András György

IEEE Trans. Inf. Theory, 1999

Zero Capacity Region of Multidimensional Run Length Constraints.

[BibT_eX]

[DOI]

Electron. J. Comb., 1999

Channel code blocklength and rate optimization for progressive image transmission.

[BibT_eX]

[DOI]

Xiaodong Tian

Proceedings of the 1999 IEEE Wireless Communications and Networking Conference, 1999

Capacity Bounds for the 3-Dimensional (0, 1) Runlength Limited Channel.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 1999

1998

Binary Lattice Vector Quantization with Linear Block Codes and Affine Index Assignments.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1998

Error protection for progressive image transmission over memoryless and fading channels.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 1998

Memory constrained wavelet based image coding.

[BibT_eX]

[DOI]

Pamela C. Cosman

IEEE Signal Process. Lett., 1998

A Polygonal Line Algorithm for Constructing Principal Curves.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 11, [NIPS Conference, Denver, Colorado, USA, November 30, 1998

Joint Source-Channel Image Coding for a Power Constrained Noisy Channel.

[BibT_eX]

[DOI]

Marc P. C. Fossorier

Zixiang Xiong

Proceedings of the 1998 IEEE International Conference on Image Processing, 1998

Image Compression for Memory Constrained Printers.

[BibT_eX]

Pamela C. Cosman

Proceedings of the 1998 IEEE International Conference on Image Processing, 1998

The Multiple Description Rate Region for High Resolution Source Coding.

[BibT_eX]

[DOI]

Ram Zamir

Proceedings of the Data Compression Conference, 1998

1997

Existence of optimal prefix codes for infinite source alphabets.

[BibT_eX]

[DOI]

Vahid Tarokh

IEEE Trans. Inf. Theory, 1997

Empirical quantizer design in the presence of source noise or channel noise.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1997

Tradeoff between source and channel coding.

[BibT_eX]

[DOI]

Bertrand M. Hochwald

IEEE Trans. Inf. Theory, 1997

Asymptotically dense spherical codes - Part II: Laminated spherical codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1997

Asymptotically dense spherical codes - Part h Wrapped spherical codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1997

Improved bounds on maximum size binary radar arrays.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1997

Progressive image coding for noisy channels.

[BibT_eX]

[DOI]

IEEE Signal Process. Lett., 1997

Progressive Image Coding with Spatially Variable Resolution.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 1997 International Conference on Image Processing, 1997

1996

Concept learning using complexity regularization.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1996

On the cost of finite block length in quantizing unbounded memoryless sources.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1996

Designing Vector Quantizers in the Presence of Source Noise or Channel Noise.

[BibT_eX]

[DOI]

Proceedings of the 6th Data Compression Conference (DCC '96), Snowbird, Utah, USA, March 31, 1996

1995

Nonparametric estimation via empirical risk minimization.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1995

Fixed-rate universal lossy source coding and rates of convergence for memoryless sources.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1995

1994

Asymptotic bounds on optimal noisy channel optimization via random coding.

[BibT_eX]

[DOI]

V. Manzella

IEEE Trans. Inf. Theory, 1994

Number of nearest neighbors in a Euclidean code.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1994

Asymptotic entropy-constrained performance of tessellating and universal randomized lattice quantization.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1994

Rates of convergence in the source coding theorem, in empirical quantizer design, and in universal lossy source coding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1994

Universal source coding with codebook transmission.

[BibT_eX]

[DOI]

Anurag Bist

IEEE Trans. Commun., 1994

1993

Average number of facets per cell in tree-structured vector quantizer partitions.

[BibT_eX]

[DOI]

Miriam R. Kantorovitz

IEEE Trans. Inf. Theory, 1993

Corrected proof of de Buda's theorem.

[BibT_eX]

Christian Schlegel

IEEE Trans. Inf. Theory, 1993

Universality and Rates of Convergence in Lossy Source Coding.

[BibT_eX]

[DOI]

Proceedings of the IEEE Data Compression Conference, 1993

1992

Globally optimal vector quantizer design by stochastic relaxation.

[BibT_eX]

[DOI]

Jacques Vaisey

IEEE Trans. Signal Process., 1992

Competitive learning and soft competition for vector quantizer design.

[BibT_eX]

[DOI]

Eyal Yair

IEEE Trans. Signal Process., 1992

Robust quantization of memoryless sources using dispersive FIR filters.

[BibT_eX]

[DOI]

Kris Popat

IEEE Trans. Commun., 1992

Universal adaptive vector quantization using codebook quantization with application to image compression.

[BibT_eX]

[DOI]

Anurag Bist

Proceedings of the 1992 IEEE International Conference on Acoustics, 1992

1991

Corrections to 'Gradient algorithms for designing predictive vector quantizers'.

[BibT_eX]

[DOI]

IEEE Trans. Signal Process., 1991

A parallel processing algorithm for vector quantizer design based on subpartitioning.

[BibT_eX]

[DOI]

Proceedings of the 1991 International Conference on Acoustics, 1991

1990

Efficient Solution to Some Problems in Free Partially Commutative Monoids

[BibT_eX]

[DOI]

Hai-Ning Liu

Celia Wrathall

Inf. Comput., December, 1990

Pseudo-Gray coding.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 1990

Conjugate gradient methods for designing vector quantizers.

[BibT_eX]

[DOI]

Eyal Yair