Sciweavers

725 search results - page 44 / 145
» Bounding Degrees on RPL
Sort
View
CORR
2008
Springer
115views Education» more  CORR 2008»
14 years 9 months ago
Lower Bounds on the Rate-Distortion Function of LDGM Codes
Abstract-- We analyze the performance of low-density generator matrix (LDGM) codes for lossy source coding. We first develop a generic technique for deriving lower bounds on the ef...
Alexandros G. Dimakis, Martin J. Wainwright, Kanna...
WDAG
2005
Springer
130views Algorithms» more  WDAG 2005»
15 years 3 months ago
Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...
Fabian Kuhn, Thomas Moscibroda, Tim Nieberg, Roger...
CRYPTO
2000
Springer
145views Cryptology» more  CRYPTO 2000»
15 years 2 months ago
Nonlinearity Bounds and Constructions of Resilient Boolean Functions
In this paper we investigate the relationship between the nonlinearity and the order of resiliency of a Boolean function. We first prove a sharper version of McEliece theorem for ...
Palash Sarkar, Subhamoy Maitra
CORR
2007
Springer
116views Education» more  CORR 2007»
14 years 9 months ago
Rate Bounds for MIMO Relay Channels Using Message Splitting
This paper considers the multi-input multi-output (MIMO) relay channel where multiple antennas are employed by each terminal. Compared to single-input singleoutput (SISO) relay ch...
Caleb K. Lo, Sriram Vishwanath, Robert W. Heath Jr...
JAT
2010
61views more  JAT 2010»
14 years 8 months ago
Close-to-optimal bounds for SU(N) loop approximation
In [6], we proved an asymptotic O(n−α/(α+1)) bound for the approximation of SU(N) loops (N ≥ 2) with Lipschitz smoothness α > 1/2 by polynomial loops of degree ≤ n. Th...
Peter Oswald, Tatiana Shingel