Sciweavers

1005 search results - page 61 / 201
» On genomic coding theory
Sort
View
ECCC
2007
96views more  ECCC 2007»
13 years 7 months ago
Linear programming bounds for codes via a covering argument
We recover the first linear programming bound of McEliece, Rodemich, Rumsey, and Welch for binary error-correcting codes and designs via a covering argument. It is possible to sh...
Michael Navon, Alex Samorodnitsky
IJON
2007
96views more  IJON 2007»
13 years 7 months ago
How do stimulus-dependent correlations between V1 neurons affect neural coding?
Nearby neurons in the visual cortex often partially synchronize their spiking activity. Despite the widespread observation of this phenomenon, its importance for visual coding and...
Fernando Montani, Adam Kohn, Matthew A. Smith, Sim...
WICON
2008
13 years 9 months ago
Stability regions of two-way relaying with network coding
We consider a pair of nodes with stochastic traffic flows who wish to communicate in a bi-directional communication scenario using intermediate relays in two-hop fashion. Intermed...
Ertugrul Necdet Ciftcioglu, Aylin Yener, Randall B...
ECCC
2010
79views more  ECCC 2010»
13 years 7 months ago
IP = PSPACE using Error Correcting Codes
The IP theorem, which asserts that IP = PSPACE (Lund et. al., and Shamir, in J. ACM 39(4)), is one of the major achievements of complexity theory. The known proofs of the theorem ...
Or Meir
TCOM
2008
120views more  TCOM 2008»
13 years 7 months ago
Network Coding for Efficient Multicast Routing in Wireless Ad-hoc Networks
Network coding is a powerful coding technique that has been proved to be very effective in achieving the maximum multicast capacity. It is especially suited for new emerging networ...
Jingyao Zhang, Pingyi Fan, Khaled Ben Letaief