Results 1  10
of
1,558,908
A SubConstant ErrorProbability LowDegree Test, and a SubConstant ErrorProbability PCP Characterization of NP
 IN PROC. 29TH ACM SYMP. ON THEORY OF COMPUTING, 475484. EL PASO
, 1997
"... We introduce a new lowdegreetest, one that uses the restriction of lowdegree polynomials to planes (i.e., affine subspaces of dimension 2), rather than the restriction to lines (i.e., affine subspaces of dimension 1). We prove the new test to be of a very small errorprobability (in particular, ..."
Abstract

Cited by 339 (20 self)
 Add to MetaCart
, and such that the errorprobability is 2 \Gamma log 1\Gammaffl n . Our results are in fact stronger, as stated below. One application of the new characterization of NP is that approximating SETCOVER to within a logarithmic factors is NPhard. Previous analysis for lowdegreetests, as well as previous
Error probability
, 2004
"... 2. Wireless links in sensor networks 3. Wireless fading channel characterization 4. A unified model for wireless fading statistics based on SIRP/Fox Hfunctions 5. Random media modeling 6. Conclusions – theoretical and practical system implications 31. Wireless sensor network performance • Packet lo ..."
Abstract
 Add to MetaCart
2. Wireless links in sensor networks 3. Wireless fading channel characterization 4. A unified model for wireless fading statistics based on SIRP/Fox Hfunctions 5. Random media modeling 6. Conclusions – theoretical and practical system implications 31. Wireless sensor network performance • Packet loss is a basic measure of performance of a packet network (e.g., sensor network) • Packet loss depends on many layers in the OSI • We consider only the wireless links of the physical layer that use lowpower radios in hostile fading propagation media • In a wireless sensor network, packet loss can not to analyzed or predicted without a basic understanding of the radio propagation issue
Conditional Entropy and Error Probability
"... Abstract—Fano’s inequality relates the error probability and conditional entropy of a finitelyvalued random variable X given another random variable Y. It is not necessarily tight when the marginal distribution of X is fixed. In this paper, we consider both finite and countably infinite alphabets. ..."
Abstract
 Add to MetaCart
Abstract—Fano’s inequality relates the error probability and conditional entropy of a finitelyvalued random variable X given another random variable Y. It is not necessarily tight when the marginal distribution of X is fixed. In this paper, we consider both finite and countably infinite alphabets
Action Selection Error Probabilities
"... The Kitajima and Polson model of displaybased humancomputer interaction (1992, 1994, in press) can make errors even if the model is provided with sufficient knowledge to perform correct actions. The major cause of errors is the failure to retrieve from longterm memory the knowledge necessary to s ..."
Abstract
 Add to MetaCart
to select a correct action. This paper derives a set of mathematical formulae that calculate the probability of an error at a specific step in a task. This technique can replace a lengthy simulation runs that would be required to obtain reliable error probabilities. Each step in an example graph
Symbol Error Probabilities For General Cooperative Links
 IEEE IEEE WIRELESS COMMUNICATIONS
, 2005
"... Cooperative diversity (CD) networks have been receiving a lot of attention recently as a distributed means of improving error performance and capacity. For sufficiently large signaltonoise ratio (SNR), this paper derives the average symbol error probability (SEP) for analog forwarding CD links. T ..."
Abstract

Cited by 140 (3 self)
 Add to MetaCart
Cooperative diversity (CD) networks have been receiving a lot of attention recently as a distributed means of improving error performance and capacity. For sufficiently large signaltonoise ratio (SNR), this paper derives the average symbol error probability (SEP) for analog forwarding CD links
Symbol Error Probability and Bit Error Probability for Optimum Combining with MPSK Modulation
, 2004
"... 0 New expressions are derived for the exact symbol error probability and bit error probability for OC with multiple phaseshift keying. The expressions are for any numbers of equal power cochannel interferers and receive branches. It is assumed that the aggregate interference and noise is Gaussian ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
0 New expressions are derived for the exact symbol error probability and bit error probability for OC with multiple phaseshift keying. The expressions are for any numbers of equal power cochannel interferers and receive branches. It is assumed that the aggregate interference and noise is Gaussian
Bit Error Probability and Encoder Structure
, 2000
"... . The problem of decoding a binary linear code used over a binary symmetric channel so as to minimize bit error probability, rather than codeword error probability, is studied. In general, there are substantial differences with the maximum likelihood case. The optimal decoding rule depends on the cr ..."
Abstract
 Add to MetaCart
. The problem of decoding a binary linear code used over a binary symmetric channel so as to minimize bit error probability, rather than codeword error probability, is studied. In general, there are substantial differences with the maximum likelihood case. The optimal decoding rule depends
On the Block Error Probability of Iteratively Decoded
 in 5th ITG Conference on Source and Channel Coding
"... The asymptotic iterative decoding performance of LDPC codes is analyzed when the block length N and the number of iterations I go to infinity. It is proved that there exist codes in the ensemble introduced by Gallager [1], and iterative decoding algorithms for these codes, for which not only the bit ..."
Abstract
 Add to MetaCart
the bit error probability P b but also the block (frame) error probability PB goes to zero as N and I go to infinity. This result is obtained by relating the block length N to the achievable number of independent decoding iterations and observing the rate at which P b converges to zero with I .
Results 1  10
of
1,558,908