Sciweavers

6 search results - page 1 / 2
» A Simple Algebraic Formulation for the Scalar Linear Network...
Sort
View
CORR
2008
Springer
95views Education» more  CORR 2008»
13 years 4 months ago
A Simple Algebraic Formulation for the Scalar Linear Network Coding Problem
In this work, we derive an algebraic formulation for the scalar linear network coding problem as an alternative to the one presented by Koetter et al in [1]. Using an equivalence b...
Abhay T. Subramanian, Andrew Thangaraj
SECON
2007
IEEE
13 years 10 months ago
INPoD: In-Network Processing over Sensor Networks based on Code Design
—In this paper, we develop a joint Network Coding (NC)-channel coding error-resilient sensor-network approach that performs In-Network Processing based on channel code Design (IN...
Kiran Misra, Shirish S. Karande, Hayder Radha
PKC
2011
Springer
219views Cryptology» more  PKC 2011»
12 years 7 months ago
Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures
ded abstract of this work appears in Public Key Cryptography — PKC 2011, ed. R. Gennaro, Springer LNCS 6571 (2011), 1–16. This is the full version. We propose a linearly homom...
Dan Boneh, David Mandell Freeman
CORR
2008
Springer
119views Education» more  CORR 2008»
13 years 4 months ago
Self-stabilizing Numerical Iterative Computation
Many challenging tasks in sensor networks, including sensor calibration, ranking of nodes, monitoring, event region detection, collaborative filtering, collaborative signal proces...
Ezra N. Hoch, Danny Bickson, Danny Dolev
CORR
2010
Springer
160views Education» more  CORR 2010»
13 years 1 months ago
Routing with Mutual Information Accumulation in Wireless Networks
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...
Rahul Urgaonkar, Michael J. Neely