Sciweavers

29 search results - page 1 / 6
» Recovering randomness from an asymptotic Hamming distance
Sort
View
ECBS
2011
IEEE
197views Hardware» more  ECBS 2011»
12 years 7 months ago
Finding Interaction Faults Adaptively Using Distance-Based Strategies
Abstract—Software systems are typically large and exhaustive testing of all possible input parameters is usually not feasible. Testers select tests that they anticipate may catch...
Renée C. Bryce, Charles J. Colbourn, D. Ric...
MA
2011
Springer
220views Communications» more  MA 2011»
13 years 2 months ago
Asymptotic expansions for a class of tests for a general covariance structure under a local alternative
Let S be a p × p random matrix having a Wishart distribution Wp(n, n−1Σ). For testing a general covariance structure Σ = Σ(ξ), we consider a class of test statistics Th = n...
Hiroaki Shimizu, Hirofumi Wakaki
COCOON
2009
Springer
14 years 1 months ago
Limits to List Decoding Random Codes
It has been known since [Zyablov and Pinsker 1982] that a random q-ary code of rate 1 − Hq(ρ) − ε (where 0 < ρ < 1 − 1/q, ε > 0 and Hq(·) is the q-ary entropy ...
Atri Rudra
JCT
2000
96views more  JCT 2000»
13 years 7 months ago
On Tail Distribution of Interpost Distance
A partial order on Z obtained by taking the transitive closure of a random relation {i < j and there is an edge ij} is studied. Randomness stems from postulating that an edge ij...
Jeong Han Kim, Boris Pittel