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

Orthogonal F-rectangles, orthogonal arrays, and codes

โœ Scribed by Walter T Federer; John P Mandeli

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
735 KB
Volume
43
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Pairwise orthogonal F-rectangle designs
Pairwise orthogonal F-rectangle designs
โœ W.T. Federer; A.S. Hedayat; J.P. Mandeli ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 577 KB
Arrays for orthogonal designs
Arrays for orthogonal designs
โœ H. Kharaghani ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 106 KB

for some permutation ' of the set f1Y 2Y F F F Y 2ng. An inยฎnite number of arrays which are suitable for any amicable set of eight circulant matrices are introduced. Applications include new classes of orthogonal designs.

Orthogonal arrays of strength 3
Orthogonal arrays of strength 3
โœ Donald L. Kreher ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 160 KB

A new construction for orthogonal arrays of strength 3 is given. 0 1996 John Wiley & Sons, Inc. ## 1 . INTRODUCTION An orthogonal array of size N, degree k, order s, and strength t is a k by N array with entries from a set of s 2 2 symbols, having the property that in every t by N subarray, every

Coding-theoretic constructions for (t,m,
Coding-theoretic constructions for (t,m,s)-nets and ordered orthogonal arrays
โœ Jรผrgen Bierbrauer; Yves Edel; Wolfgang Ch. Schmid ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 169 KB

## Abstract (__t__,__m__,__s__)โ€nets are point sets in Euclidean __s__โ€space satisfying certain uniformity conditions, for use in numerical integration. They can be equivalently described in terms of ordered orthogonal arrays, a class of finite geometrical structures generalizing orthogonal arrays.