Sciweavers

437 search results - page 36 / 88
» Randomized Lattice Decoding
Sort
View
IPSN
2004
Springer
15 years 5 months ago
Lattice sensor networks: capacity limits, optimal routing and robustness to failures
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
Guillermo Barrenechea, Baltasar Beferull-Lozano, M...
CSREASAM
2003
15 years 1 months ago
Randomized Traitor Tracing Algorithms for Broadcast Security
We introduce and analyze a randomized traitor tracing algorithm for broadcast security. This algorithm is very efficient compared to brute force methods (the mean time it takes is...
Simon McNicol, Serdar Boztas
COMBINATORICS
2000
61views more  COMBINATORICS 2000»
14 years 11 months ago
Where the Typical Set Partitions Meet and Join
The lattice of the set partitions of [n] ordered by refinement is studied. Suppose r partitions p1, . . . , pr are chosen independently and uniformly at random. The probability tha...
Boris Pittel
ICCAD
2006
IEEE
100views Hardware» more  ICCAD 2006»
15 years 8 months ago
Nanowire addressing with randomized-contact decoders
— Methods for assembling crossbars from nanowires (NWs) have been designed and implemented. Methods for controlling individual NWs within a crossbar have also been proposed, but ...
Eric Rachlin, John E. Savage
JSAC
1998
126views more  JSAC 1998»
14 years 11 months ago
Iterative Decoding of Compound Codes by Probability Propagation in Graphical Models
Abstract—We present a unified graphical model framework for describing compound codes and deriving iterative decoding algorithms. After reviewing a variety of graphical models (...
Frank R. Kschischang, Brendan J. Frey