• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 39 matches

• 2017
• 
  Joseph Connelly, Kenneth Zeger:
  A Class of Non-Linearly Solvable Networks. IEEE Trans. Inf. Theory 63(1): 201-229 (2017)
• 2016
• 
  Joseph Connelly, Kenneth Zeger:
  A class of non-linearly solvable networks. ISIT 2016: 1964-1968
• 
  Joseph Connelly, Kenneth Zeger:
  A Class of Non-Linearly Solvable Networks. CoRR abs/1601.03803 (2016)
• 2013
• 
  Rathinakumar Appuswamy, Massimo Franceschetti, Nikhil Karamchandani, Kenneth Zeger:
  Linear Codes, Target Function Classes, and Network Computing Capacity. IEEE Trans. Inf. Theory 59(9): 5741-5753 (2013)
• 2011
• 
  Rathinakumar Appuswamy, Massimo Franceschetti, Nikhil Karamchandani, Kenneth Zeger:
  Network Coding for Computing: Cut-Set Bounds. IEEE Trans. Inf. Theory 57(2): 1015-1030 (2011)
• 
  Rathinakumar Appuswamy, Massimo Franceschetti, Nikhil Karamchandani, Kenneth Zeger:
  Linear coding for network computing. ISIT 2011: 2652-2655
• 
  Rathinakumar Appuswamy, Massimo Franceschetti, Nikhil Karamchandani, Kenneth Zeger:
  Network coding for computing: Linear codes. CoRR abs/1101.0085 (2011)
• 2009
• 
  Rathinakumar Appuswamy, Massimo Franceschetti, Nikhil Karamchandani, Kenneth Zeger:
  Network computing capacity for the reverse butterfly network. ISIT 2009: 259-262
• 
  Rathinakumar Appuswamy, Massimo Franceschetti, Nikhil Karamchandani, Kenneth Zeger:
  Network Coding for Computing Part I : Cut-Set Bounds. CoRR abs/0912.2820 (2009)
• 2008
• 
  Jillian Cannons, Kenneth Zeger:
  Network Coding Capacity With a Constrained Number of Coding Nodes. IEEE Trans. Inf. Theory 54(3): 1287-1291 (2008)
• 
  Rathinakumar Appuswamy, Massimo Franceschetti, Nikhil Karamchandani, Kenneth Zeger:
  Network coding for computing. Allerton 2008: 1-6
• 2006
• 
  Rathinakumar Appuswamy, Massimo Franceschetti, Kenneth Zeger:
  Optimality of Linear Codes for Broadcast-Mode Multicast Networks. ISIT 2006: 50-53
• 2003
• 
  Christopher F. Freiling, Douglas S. Jungreis, François Théberge, Kenneth Zeger:
  Almost all complete binary prefix codes have a self-synchronizing string. IEEE Trans. Inf. Theory 49(9): 2219-2225 (2003)
• 2002
• 
  Erik Agrell, Thomas Eriksson, Alexander Vardy, Kenneth Zeger:
  Closest point search in lattices. IEEE Trans. Inf. Theory 48(8): 2201-2214 (2002)
• 2001
• 
  Marc P. C. Fossorier, Zixiang Xiong, Kenneth Zeger:
  Progressive source coding for a power constrained Gaussian channel. IEEE Trans. Commun. 49(8): 1301-1306 (2001)
• 
  Erik Agrell, Alexander Vardy, Kenneth Zeger:
  A table of upper bounds for binary codes. IEEE Trans. Inf. Theory 47(7): 3004-3006 (2001)
• 2000
• 
  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)
• 
  Erik Agrell, Alexander Vardy, Kenneth Zeger:
  Upper bounds for constant-weight codes. IEEE Trans. Inf. Theory 46(7): 2373-2395 (2000)
• 
  Akiko Kato, Kenneth Zeger:
  Partial characterization of the positive capacity region of two-dimensional asymmetric run length constrained channels. IEEE Trans. Inf. Theory 46(7): 2666-2670 (2000)
• 
  András Méhes, Kenneth Zeger:
  Source and channel rate allocation for channel codes satisfying the Gilbert-Varshamov or Tsfasman-Vladut-Zink bounds. IEEE Trans. Inf. Theory 46(6): 2133-2151 (2000)
• 
  András Méhes, Kenneth Zeger:
  Performance of quantizers on noisy channels using structured families of codes. IEEE Trans. Inf. Theory 46(7): 2468-2476 (2000)
• 1999
• 
  Hisashi Ito, Akiko Kato, Zsigmond Nagy, Kenneth Zeger:
  Zero Capacity Region of Multidimensional Run Length Constraints. Electron. J. Comb. 6 (1999)
• 
  András György, Tamás Linder, Kenneth Zeger:
  On the rate-distortion function of random vectors and stationary sources with mixed distributions. IEEE Trans. Inf. Theory 45(6): 2110-2115 (1999)
• 
  Akiko Kato, Kenneth Zeger:
  On the capacity of two-dimensional run-length constrained channels. IEEE Trans. Inf. Theory 45(5): 1527-1540 (1999)
• 
  András Méhes, Kenneth Zeger:
  Randomly Chosen Index Assignments Are Asymptotically Bad for Uniform Sources. IEEE Trans. Inf. Theory 45(2): 788-794 (1999)
• 
  Vahid Tarokh, Alexander Vardy, Kenneth Zeger:
  Universal Bound on the Performance of Lattice Codes. IEEE Trans. Inf. Theory 45(2): 670-681 (1999)
• 
  András Méhes, Kenneth Zeger:
  Performance of Quantizers on Noisy Channels Using Structured Families of Codes. Data Compression Conference 1999: 473-482
• 1998
• 
  András Méhes, Kenneth Zeger:
  Binary Lattice Vector Quantization with Linear Block Codes and Affine Index Assignments. IEEE Trans. Inf. Theory 44(1): 79-94 (1998)
• 
  Marc P. C. Fossorier, Zixiang Xiong, Kenneth Zeger:
  Joint Source-Channel Image Coding for a Power Constrained Noisy Channel. ICIP (2) 1998: 122-126
• 
  Balázs Kégl, Adam Krzyzak, Tamás Linder, Kenneth Zeger:
  A Polygonal Line Algorithm for Constructing Principal Curves. NIPS 1998: 501-507

skipping 9 more matches