Bounds on orthogonal arrays and resilient functions
✍ Scribed by Jürgen Bierbrauer
- Publisher
- John Wiley and Sons
- Year
- 1995
- Tongue
- English
- Weight
- 212 KB
- Volume
- 3
- Category
- Article
- ISSN
- 1063-8539
No coin nor oath required. For personal study only.
✦ Synopsis
The only known general bounds on the parameters of orthogonal arrays are those given by Rao in 1947 [J. Roy. Statist. Soc. 9 (1947), 128-1391 for general O A ~ ( t , k , v ) and by Bush [Ann. Math. Stat. 23, (1952), 426-4341 [3] in 1952 for the special case A = 1. We present an algebraic method based on characters of homocyclic groups which yields the Rao bounds, the Bush bound in case t 2 v, and more importantly a new explicit bound which for large values of t (the strength of the array) is much better than the Rao bound. In the case of binary orthogonal arrays where all rows are distinct this bound was previously proved by Friedman [Proc. 33rd IEEE Symp. on Foundations of Comput. Sci., (1992), 314-3191 in a different setting. w e also note an application to resilient functions. 0 1995 John Wiley & Sons, he.
📜 SIMILAR VOLUMES
In this paper, using the approach developed by the author in a previous paper, we deduce some bounds and inequalities for arbitrary orthogonal polynomials on finite intervals and give their various applications. 1995 Academic Press. Inc.
In this paper using a new effective approach we deduce some bounds and inequalities for general orthogonal polynomials on finite intervals and give their applications to convergence of orthogonal Fourier series, Lagrange interpolation, orthogonal series with gaps, and Hermite-Fejér interpolation, as
## Abstract It is shown how the convergence requirements for a finite element may be written as a set of linear constraints on the stiffness matrix. It is then attempted to construct a best possible stiffness matrix. The constraint equations restrict the way in which these stiffness terms may be ch