๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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 robust block adaptive algorithm using
โœ Sadanobu Yoshimoto; Toshihiro Furukawa; Kiichi Urahama ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 313 KB

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

Further results on the maximum size of a
โœ I. Adamczak; D. L. Kreher; A. C. H. Ling; R. S. Rees ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 192 KB ๐Ÿ‘ 1 views

## 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__โ€‰โ‰ฅโ€‰_