András Méhes, Kenneth Zeger Performance of Quantizers on Noisy Channels Using Structured Families of Codes. [Citation Graph (0, 0)][DBLP] Data Compression Conference, 1999, pp:473-482 [Conf]
András György, Tamás Linder, Kenneth Zeger On the rate-distortion function of random vectors and stationary sources with mixed distributions. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1999, v:45, n:6, pp:2110-2115 [Journal]
Akiko Kato, Kenneth Zeger Partial characterization of the positive capacity region of two-dimensional asymmetric run length constrained channels. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2666-2670 [Journal]
Akiko Kato, Kenneth Zeger On the capacity of two-dimensional run-length constrained channels. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1999, v:45, n:5, pp:1527-1540 [Journal]
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. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1994, v:40, n:6, pp:1728-1740 [Journal]
Tamás Linder, Kenneth Zeger Asymptotic entropy-constrained performance of tessellating and universal randomized lattice quantization. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1994, v:40, n:2, pp:575-0 [Journal]
Tamás Linder, Kenneth Zeger On the cost of finite block length in quantizing unbounded memoryless sources. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1996, v:42, n:2, pp:480-487 [Journal]
András Méhes, Kenneth Zeger Source and channel rate allocation for channel codes satisfying the Gilbert-Varshamov or Tsfasman-Vladut-Zink bounds. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2000, v:46, n:6, pp:2133-2151 [Journal]
András Méhes, Kenneth Zeger Performance of quantizers on noisy channels using structured families of codes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2468-2476 [Journal]
András Méhes, Kenneth Zeger Binary Lattice Vector Quantization with Linear Block Codes and Affine Index Assignments. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1998, v:44, n:1, pp:79-94 [Journal]
András Méhes, Kenneth Zeger Randomly Chosen Index Assignments Are Asymptotically Bad for Uniform Sources. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:788-794 [Journal]
Zsigmond Nagy, Kenneth Zeger Capacity bounds for the three-dimensional (0, 1) run length limited channel. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:1030-1033 [Journal]
Zsigmond Nagy, Kenneth Zeger Asymptotic capacity of two-dimensional channels with checkerboard constraints. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2003, v:49, n:9, pp:2115-2125 [Journal]
Zsigmond Nagy, Kenneth Zeger Bit-stuffing algorithms and analysis for run-length constrained channels in two and three dimensions. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2004, v:50, n:12, pp:3146-3169 [Journal]
Kenneth Zeger, V. Manzella Asymptotic bounds on optimal noisy channel optimization via random coding. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1994, v:40, n:6, pp:1926-1938 [Journal]
Benjamin Farber, Kenneth Zeger Quantization of Multiple Sources Using Nonnegative Integer Bit Allocation. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:11, pp:4945-4964 [Journal]
Randall Dougherty, Kenneth Zeger Nonreversibility and Equivalent Constructions of Multiple-Unicast Networks. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:11, pp:5067-5077 [Journal]