Balanced block designs robust against the loss of a single observation
โ Scribed by Dexter C. Whittinghill III
- Publisher
- Elsevier Science
- Year
- 1989
- Tongue
- English
- Weight
- 611 KB
- Volume
- 22
- Category
- Article
- ISSN
- 0378-3758
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
A block orthogonal projection algorithm is proposed as a technique to balance convergence speed with computational complexity. However, if the observed noise is convolved with the output signal of an unknown system, a shortcoming of the block orthogonal projection algorithm is the susceptibility of
## Abstract Kreher and Rees 3 proved that if __h__ is the size of a hole in an incomplete balanced design of order ฯ and index ฮป having minimum block size $k \ge t+1$, then, They showed that when __t__โ=โ2 or 3, this bound is sharp infinitely often in that for each __h__โโฅโ__t__ and each __k__โโฅโ_