| 2008 |
|---|
| 67 | EE | J. Cannons,
Kenneth Zeger:
Network Coding Capacity With a Constrained Number of Coding Nodes.
IEEE Transactions on Information Theory 54(3): 1287-1291 (2008) |
| 66 | EE | Randall Dougherty,
Chris Freiling,
Kenneth Zeger:
Linear Network Codes and Systems of Polynomial Equations.
IEEE Transactions on Information Theory 54(5): 2303-2316 (2008) |
| 2007 |
|---|
| 65 | EE | Randall Dougherty,
Christopher F. Freiling,
Kenneth Zeger:
Networks, Matroids, and Non-Shannon Information Inequalities.
IEEE Transactions on Information Theory 53(6): 1949-1969 (2007) |
| 2006 |
|---|
| 64 | EE | Benjamin Farber,
Kenneth Zeger:
Quantization of Multiple Sources Using Nonnegative Integer Bit Allocation.
IEEE Transactions on Information Theory 52(11): 4945-4964 (2006) |
| 63 | EE | Randall Dougherty,
Kenneth Zeger:
Nonreversibility and Equivalent Constructions of Multiple-Unicast Networks.
IEEE Transactions on Information Theory 52(11): 5067-5077 (2006) |
| 62 | EE | Benjamin Farber,
Kenneth Zeger:
Quantizers with uniform decoders and channel-optimized encoders.
IEEE Transactions on Information Theory 52(2): 640-661 (2006) |
| 61 | EE | J. Cannons,
Randall Dougherty,
Christopher F. Freiling,
Kenneth Zeger:
Network routing capacity.
IEEE Transactions on Information Theory 52(3): 777-788 (2006) |
| 60 | EE | Randall Dougherty,
Christopher F. Freiling,
Kenneth Zeger:
Unachievability of network coding capacity.
IEEE Transactions on Information Theory 52(6): 2365-2372 (2006) |
| 2005 |
|---|
| 59 | EE | Benjamin Farber,
Kenneth Zeger:
Quantization of Multiple Sources Using Integer Bit Allocation.
DCC 2005: 368-377 |
| 58 | EE | Zsolt Kukorelly,
Kenneth Zeger:
Sufficient conditions for existence of binary fix-free codes.
IEEE Transactions on Information Theory 51(10): 3433-3444 (2005) |
| 57 | EE | Randall Dougherty,
Christopher F. Freiling,
Kenneth Zeger:
Insufficiency of linear coding in network information flow.
IEEE Transactions on Information Theory 51(8): 2745-2759 (2005) |
| 2004 |
|---|
| 56 | | Benjamin Farber,
Kenneth Zeger:
Quantizers with uniform encoders and channel optimized decoders.
IEEE Transactions on Information Theory 50(1): 62-77 (2004) |
| 55 | | Randall Dougherty,
Christopher F. Freiling,
Kenneth Zeger:
Linearity and solvability in multicast networks.
IEEE Transactions on Information Theory 50(10): 2243-2256 (2004) |
| 54 | EE | Zsigmond Nagy,
Kenneth Zeger:
Bit-stuffing algorithms and analysis for run-length constrained channels in two and three dimensions.
IEEE Transactions on Information Theory 50(12): 3146-3169 (2004) |
| 53 | | Michelle Effros,
Hanying Feng,
Kenneth Zeger:
Suboptimality of the Karhunen-LoE`ve Transform for Transform Coding.
IEEE Transactions on Information Theory 50(8): 1605-1619 (2004) |
| 2003 |
|---|
| 52 | EE | Michelle Effros,
Hanying Feng,
Kenneth Zeger:
Suboptimality of the Karhuenen-Loève Transform for Transform Coding.
DCC 2003: 293-302 |
| 51 | | Zsigmond Nagy,
Kenneth Zeger:
Asymptotic capacity of two-dimensional channels with checkerboard constraints.
IEEE Transactions on Information Theory 49(9): 2115-2125 (2003) |
| 50 | | Christopher F. Freiling,
Douglas S. Jungreis,
François Théberge,
Kenneth Zeger:
Almost all complete binary prefix codes have a self-synchronizing string.
IEEE Transactions on Information Theory 49(9): 2219-2225 (2003) |
| 2002 |
|---|
| 49 | EE | Benjamin Farber,
Kenneth Zeger:
Quantizers with Uniform Encoders and Channel Optimized Decoders.
DCC 2002: 292-301 |
| 48 | | Tamás Frajka,
Kenneth Zeger:
Residual image coding for stereo image compression.
ICIP (2) 2002: 271-220 |
| 47 | | Jon Hamkins,
Kenneth Zeger:
Gaussian source coding with spherical codes.
IEEE Transactions on Information Theory 48(11): 2980-2989 (2002) |
| 46 | | Erik Agrell,
Thomas Eriksson,
Alexander Vardy,
Kenneth Zeger:
Closest point search in lattices.
IEEE Transactions on Information Theory 48(8): 2201-2214 (2002) |
| 2001 |
|---|
| 45 | | Erik Agrell,
Alexander Vardy,
Kenneth Zeger:
A table of upper bounds for binary codes.
IEEE Transactions on Information Theory 47(7): 3004-3006 (2001) |
| 2000 |
|---|
| 44 | | P. Greg Sherwood,
Xiaodong Tian,
Kenneth Zeger:
Efficient Image and Channel Coding for Wireless Packet Networks.
ICIP 2000 |
| 43 | EE | Balázs Kégl,
Adam Krzyzak,
Tamás Linder,
Kenneth Zeger:
Learning and Design of Principal Curves.
IEEE Trans. Pattern Anal. Mach. Intell. 22(3): 281-297 (2000) |
| 42 | EE | Pamela C. Cosman,
Jon K. Rogers,
P. Greg Sherwood,
Kenneth Zeger:
Combined forward error control and packetized zerotree wavelet encoding for transmission of images over varying channels.
IEEE Transactions on Image Processing 9(6): 982-993 (2000) |
| 41 | | Zsigmond Nagy,
Kenneth Zeger:
Capacity bounds for the three-dimensional (0, 1) run length limited channel.
IEEE Transactions on Information Theory 46(3): 1030-1033 (2000) |
| 40 | | András Méhes,
Kenneth Zeger:
Source and channel rate allocation for channel codes satisfying the Gilbert-Varshamov or Tsfasman-Vladut-Zink bounds.
IEEE Transactions on Information Theory 46(6): 2133-2151 (2000) |
| 39 | | Erik Agrell,
Alexander Vardy,
Kenneth Zeger:
Upper bounds for constant-weight codes.
IEEE Transactions on Information Theory 46(7): 2373-2395 (2000) |
| 38 | | András Méhes,
Kenneth Zeger:
Performance of quantizers on noisy channels using structured families of codes.
IEEE Transactions on Information Theory 46(7): 2468-2476 (2000) |
| 37 | | Akiko Kato,
Kenneth Zeger:
Partial characterization of the positive capacity region of two-dimensional asymmetric run length constrained channels.
IEEE Transactions on Information Theory 46(7): 2666-2670 (2000) |
| 36 | | Tamás Linder,
Ram Zamir,
Kenneth Zeger:
On source coding with side-information-dependent distortion measures.
IEEE Transactions on Information Theory 46(7): 2697-2704 (2000) |
| 1999 |
|---|
| 35 | | Zsigmond Nagy,
Kenneth Zeger:
Capacity Bounds for the 3-Dimensional (0, 1) Runlength Limited Channel.
AAECC 1999: 245-251 |
| 34 | EE | András Méhes,
Kenneth Zeger:
Performance of Quantizers on Noisy Channels Using Structured Families of Codes.
Data Compression Conference 1999: 473-482 |
| 33 | EE | Hisashi Ito,
Akiko Kato,
Zsigmond Nagy,
Kenneth Zeger:
Zero Capacity Region of Multidimensional Run Length Constraints.
Electr. J. Comb. 6: (1999) |
| 32 | | Tamás Linder,
Ram Zamir,
Kenneth Zeger:
High-Resolution Source Coding for Non-Difference Distortion Measures: Multidimensional Companding.
IEEE Transactions on Information Theory 45(2): 548-561 (1999) |
| 31 | | Vahid Tarokh,
Alexander Vardy,
Kenneth Zeger:
Universal Bound on the Performance of Lattice Codes.
IEEE Transactions on Information Theory 45(2): 670-681 (1999) |
| 30 | | András Méhes,
Kenneth Zeger:
Randomly Chosen Index Assignments Are Asymptotically Bad for Uniform Sources.
IEEE Transactions on Information Theory 45(2): 788-794 (1999) |
| 29 | | Akiko Kato,
Kenneth Zeger:
On the capacity of two-dimensional run-length constrained channels.
IEEE Transactions on Information Theory 45(5): 1527-1540 (1999) |
| 28 | | András György,
Tamás Linder,
Kenneth Zeger:
On the rate-distortion function of random vectors and stationary sources with mixed distributions.
IEEE Transactions on Information Theory 45(6): 2110-2115 (1999) |
| 1998 |
|---|
| 27 | EE | Tamás Linder,
Ram Zamir,
Kenneth Zeger:
The Multiple Description Rate Region for High Resolution Source Coding.
Data Compression Conference 1998: 149-158 |
| 26 | | P. Greg Sherwood,
Kenneth Zeger:
Error Protection for Progressive Image Transmission over Memoryless and Fading Channels.
ICIP (1) 1998: 324-328 |
| 25 | | Marc P. C. Fossorier,
Zixiang Xiong,
Kenneth Zeger:
Joint Source-Channel Image Coding for a Power Constrained Noisy Channel.
ICIP (2) 1998: 122-126 |
| 24 | | Pamela C. Cosman,
Tamás Frajka,
Kenneth Zeger:
Image Compression for Memory Constrained Printers.
ICIP (3) 1998: 109-113 |
| 23 | EE | Balázs Kégl,
Adam Krzyzak,
Tamás Linder,
Kenneth Zeger:
A Polygonal Line Algorithm for Constructing Principal Curves.
NIPS 1998: 501-507 |
| 22 | | András Méhes,
Kenneth Zeger:
Binary Lattice Vector Quantization with Linear Block Codes and Affine Index Assignments.
IEEE Transactions on Information Theory 44(1): 79-94 (1998) |
| 1997 |
|---|
| 21 | | P. Greg Sherwood,
Kenneth Zeger:
Progressive Image Coding on Noisy Channels.
Data Compression Conference 1997: 72-81 |
| 20 | EE | Tamás Frajka,
P. Greg Sherwood,
Kenneth Zeger:
Progressive Image Coding with Spatially Variable Resolution.
ICIP (1) 1997: 53-56 |
| 19 | | Tamás Linder,
Gábor Lugosi,
Kenneth Zeger:
Empirical quantizer design in the presence of source noise or channel noise.
IEEE Transactions on Information Theory 43(2): 612-623 (1997) |
| 18 | | Jon Hamkins,
Kenneth Zeger:
Improved bounds on maximum size binary radar arrays.
IEEE Transactions on Information Theory 43(3): 997-1000 (1997) |
| 17 | | Bertrand M. Hochwald,
Kenneth Zeger:
Tradeoff between source and channel coding.
IEEE Transactions on Information Theory 43(5): 1412-1424 (1997) |
| 16 | | Jon Hamkins,
Kenneth Zeger:
Asymptotically dense spherical codes - Part h Wrapped spherical codes.
IEEE Transactions on Information Theory 43(6): 1774-1785 (1997) |
| 15 | | Jon Hamkins,
Kenneth Zeger:
Asymptotically dense spherical codes - Part II: Laminated spherical codes.
IEEE Transactions on Information Theory 43(6): 1786-1798 (1997) |
| 14 | | Tamás Linder,
Vahid Tarokh,
Kenneth Zeger:
Existence of optimal prefix codes for infinite source alphabets.
IEEE Transactions on Information Theory 43(6): 2026-2028 (1997) |
| 1996 |
|---|
| 13 | | Tamás Linder,
Gábor Lugosi,
Kenneth Zeger:
Designing Vector Quantizers in the Presence of Source Noise or Channel Noise.
Data Compression Conference 1996: 33-42 |
| 12 | | Gábor Lugosi,
Kenneth Zeger:
Concept learning using complexity regularization.
IEEE Transactions on Information Theory 42(1): 48-54 (1996) |
| 11 | | Tamás Linder,
Kenneth Zeger:
On the cost of finite block length in quantizing unbounded memoryless sources.
IEEE Transactions on Information Theory 42(2): 480-487 (1996) |
| 1995 |
|---|
| 10 | | Tamás Linder,
Gábor Lugosi,
Kenneth Zeger:
Fixed-rate universal lossy source coding and rates of convergence for memoryless sources.
IEEE Transactions on Information Theory 41(3): 665-676 (1995) |
| 9 | | Gábor Lugosi,
Kenneth Zeger:
Nonparametric estimation via empirical risk minimization.
IEEE Transactions on Information Theory 41(3): 677-687 (1995) |
| 1994 |
|---|
| 8 | | Tamás Linder,
Kenneth Zeger:
Asymptotic entropy-constrained performance of tessellating and universal randomized lattice quantization.
IEEE Transactions on Information Theory 40(2): 575- (1994) |
| 7 | | Kenneth Zeger,
Allen Gersho:
Number of nearest neighbors in a Euclidean code.
IEEE Transactions on Information Theory 40(5): 1647- (1994) |
| 6 | | Tamás Linder,
Gábor Lugosi,
Kenneth Zeger:
Rates of convergence in the source coding theorem, in empirical quantizer design, and in universal lossy source coding.
IEEE Transactions on Information Theory 40(6): 1728-1740 (1994) |
| 5 | | Kenneth Zeger,
V. Manzella:
Asymptotic bounds on optimal noisy channel optimization via random coding.
IEEE Transactions on Information Theory 40(6): 1926-1938 (1994) |
| 1993 |
|---|
| 4 | | Tamás Linder,
Gábor Lugosi,
Kenneth Zeger:
Universality and Rates of Convergence in Lossy Source Coding.
Data Compression Conference 1993: 89-97 |
| 3 | | Kenneth Zeger,
Miriam R. Kantorovitz:
Average number of facets per cell in tree-structured vector quantizer partitions.
IEEE Transactions on Information Theory 39(3): 1053- (1993) |
| 2 | | Tamás Linder,
Christian Schlegel,
Kenneth Zeger:
Corrected proof of de Buda's theorem.
IEEE Transactions on Information Theory 39(5): 1735- (1993) |
| 1990 |
|---|
| 1 | | Hai-Ning Liu,
Celia Wrathall,
Kenneth Zeger:
Efficient Solution to Some Problems in Free Partially Commutative Monoids
Inf. Comput. 89(2): 180-198 (1990) |
