Learn More
If a linear block code C of length n has a Tanner graph without cycles, then maximum-likelihood soft-decision decoding of C can be achieved in time O(n 2). However, we show that cycle-free Tanner graphs cannot support good codes. Specifically, let C be an (n, k, d) linear code of rate R = k/n that can be represented by a Tanner graph without cycles. We(More)
We consider the problem of efficiently reconciling two similar sets held by different hosts while minimizing the communication complexity , which we call the set reconciliation problem. We describe an approach to set reconciliation based on a polynomial encoding of sets. The resulting protocols exhibit tractable computational complexity and nearly optimal(More)
— We propose a new framework for providing robust location detection in emergency response systems, based on the theory of identifying codes. The key idea of this approach is to allow sensor coverage areas to overlap in such a way that each resolvable position is covered by a unique set of sensors. In this setting, determining a sensor-placement with a(More)
— We propose a novel framework for location detection with sensor networks, based on the theory of identifying codes. The key idea of this approach is to allow sensor coverage areas to overlap so that each resolvable position is covered by a unique set of sensors. In this setting, determining a sensor-placement with a minimum number of sensors is equivalent(More)
Modern Personal Digital Assistant (PDA) architectures often utilize a wholesale data transfer protocol known as " slow sync " for synchronizing PDAs with Personal Computers (PCs). This approach is markedly inefficient with respect to bandwidth usage, latency, and energy consumption, since the PDA and PC typically share many common records. We propose,(More)
— The erasure resilience of rateless codes, such as Luby-Transform (LT) codes, makes them particularly suitable to a wide variety of loss-prone wireless and sensor network applications, ranging from digital video broadcast to software updates. Yet, traditional rateless codes usually make no use of a feedback communication channel, a feature available in(More)
— Modern Personal Digital Assistant (PDA) architectures often utilize a wholesale data transfer protocol known as " slow sync " for synchronizing PDAs with Personal Computers (PCs). This approach is markedly inefficient with respect to bandwidth usage and latency, since the PDA and PC typically share many common records. We propose, analyze, and implement a(More)
Over-the-air programming (OAP) is a fundamental service in sensor networksthat relies upon reliable broadcast for efficient dissemination. As such,existing OAP protocols become decidedly inefficient (with respect toenergy, communication or delay) in unreliable broadcast environments, suchas those with relatively high node density or noise. In this paper,(More)
The identifying code problem for a given graph involves finding a minimum set of vertices whose neighborhoods uniquely overlap at any given graph vertex. Initially introduced in 1998, this problem has demonstrated its fundamental nature through a wide variety of applications, such as fault diagnosis, location detection, and environmental monitoring, in(More)