scholarly journals Coding-theoretic constructions for (t,m,s)-nets and ordered orthogonal arrays

2002 ◽  
Vol 10 (6) ◽  
pp. 403-418 ◽  
Author(s):  
J�rgen Bierbrauer ◽  
Yves Edel ◽  
Wolfgang Ch. Schmid
Keyword(s):  
Orthogonal Arrays ◽  
Ordered Orthogonal Arrays

Association Schemes for Ordered Orthogonal Arrays and (T, M, S)-Nets

1999 ◽  
Vol 51 (2) ◽  
pp. 326-346 ◽  
Author(s):  
W. J. Martin ◽  
D. R. Stinson
Keyword(s):  
Linear Programming ◽  
Association Scheme ◽  
Type Theorem ◽  
Orthogonal Arrays ◽  
Association Schemes ◽  
Theoretic Approach ◽  
Linear Programming Bound ◽  
Ordered Orthogonal Arrays

AbstractIn an earlier paper [10], we studied a generalized Rao bound for ordered orthogonal arrays and (T, M, S)-nets. In this paper, we extend this to a coding-theoretic approach to ordered orthogonal arrays. Using a certain association scheme, we prove a MacWilliams-type theorem for linear ordered orthogonal arrays and linear ordered codes as well as a linear programming bound for the general case. We include some tables which compare this bound against two previously known bounds for ordered orthogonal arrays. Finally we show that, for even strength, the LP bound is always at least as strong as the generalized Rao bound.

A Generalized Rao Bound for Ordered Orthogonal Arrays and (t, m, s)-Nets

1999 ◽  
Vol 42 (3) ◽  
pp. 359-370 ◽  
Author(s):  
W. J. Martin ◽  
D. R. Stinson
Keyword(s):  
Necessary Conditions ◽  
Orthogonal Arrays ◽  
Ordered Orthogonal Arrays

AbstractIn this paper, we provide a generalization of the classical Rao bound for orthogonal arrays, which can be applied to ordered orthogonal arrays and (t, m, s)-nets. Application of our new bound leads to improvements in many parameter situations to the strongest bounds (i.e., necessary conditions) for existence of these objects.

scholarly journals Combinatorial Constructions Of Ordered Orthogonal Arrays & Ordered Covering Arrays

2021 ◽  
Author(s):  
Tamar Krikorian
Keyword(s):  
Orthogonal Arrays ◽  
Latin Squares ◽  
Monte Carlo Integration ◽  
Combinatorial Method ◽  
Covering Arrays ◽  
Combinatorial Objects ◽  
Quasi Monte Carlo ◽  
Combinatorial Constructions ◽  
Ordered Orthogonal Arrays ◽  
Combinatorial Methods

In this thesis, we consider combinatorial objects called ordered orthogonal arrays, which are related to orthogonal arrays and Latin squares. We also introduce a new combinatorial method to the construction of these objects, as well as developing new ones. We discuss the applications of ordered orthogonal arrays and ordered covering arrays, which generalize covering arrays. We adapt existing combinatorial methods to the construction of these objects, as well as developing new ones. We discuss the applications of ordered orthogonal arrays and ordered covering arrays to quasi-Monte Carlo integration through the construction of point sets called (t,m,s)-nets and a new object we call (t,m,s)-covering nets.

scholarly journals Constructing ordered orthogonal arrays via sudoku

2016 ◽  
Vol 15 (08) ◽  
pp. 1650139
Author(s):  
John Lorch
Keyword(s):  
Finite Field ◽  
Vector Space ◽  
Orthogonal Arrays ◽  
Dimensional Vector ◽  
Dimensional Vector Space ◽  
Type Formula ◽  
Ordered Orthogonal Arrays ◽  
Range Of Values

For prime powers [Formula: see text] we use “strongly orthogonal” linear sudoku solutions of order [Formula: see text] to construct ordered orthogonal arrays of type [Formula: see text], and for each [Formula: see text] we present a range of values of [Formula: see text] for which these constructions are valid. These results rely strongly on flags of subspaces in a four-dimensional vector space over a finite field.

scholarly journals A General Construction of Ordered Orthogonal Arrays Using LFSRs

2019 ◽  
Vol 65 (7) ◽  
pp. 4316-4326
Author(s):  
Daniel Panario ◽  
Mark Saaltink ◽  
Brett Stevens ◽  
Daniel Wevrick
Keyword(s):  
Orthogonal Arrays ◽  
General Construction ◽  
Ordered Orthogonal Arrays

scholarly journals Combinatorial Constructions Of Ordered Orthogonal Arrays & Ordered Covering Arrays

2021 ◽  
Author(s):  
Tamar Krikorian
Keyword(s):  
Orthogonal Arrays ◽  
Latin Squares ◽  
Monte Carlo Integration ◽  
Combinatorial Method ◽  
Covering Arrays ◽  
Combinatorial Objects ◽  
Quasi Monte Carlo ◽  
Combinatorial Constructions ◽  
Ordered Orthogonal Arrays ◽  
Combinatorial Methods

In this thesis, we consider combinatorial objects called ordered orthogonal arrays, which are related to orthogonal arrays and Latin squares. We also introduce a new combinatorial method to the construction of these objects, as well as developing new ones. We discuss the applications of ordered orthogonal arrays and ordered covering arrays, which generalize covering arrays. We adapt existing combinatorial methods to the construction of these objects, as well as developing new ones. We discuss the applications of ordered orthogonal arrays and ordered covering arrays to quasi-Monte Carlo integration through the construction of point sets called (t,m,s)-nets and a new object we call (t,m,s)-covering nets.

Calmodulin-mediated gating of lens gap junction channels in vesicles

1984 ◽  
Vol 42 ◽  
pp. 134-137
Author(s):  
Camillo Peracchia ◽  
Stephen J. Girsch
Keyword(s):  
Gap Junctions ◽  
Freeze Fracture ◽  
Orthogonal Arrays ◽  
Eye Lens ◽  
Lens Fiber ◽  
Cell Coupling ◽  
Particle Spacing ◽  
Fiber Cells ◽  
Gap Junction Channels ◽  
Communicating Junctions

The fiber cells of eye lens communicate directly with each other by exchanging ions, dyes and metabolites. In most tissues this type of communication (cell coupling) is mediated by gap junctions. In the lens, the fiber cells are extensively interconnected by junctions. However, lens junctions, although morphologically similar to gap junctions, differ from them in a number of structural, biochemical and immunological features. Like gap junctions, lens junctions are regions of close cell-to-cell apposition. Unlike gap junctions, however, the extracellular gap is apparently absent in lens junctions, such that their thickness is approximately 2 nm smaller than that of typical gap junctions (Fig. 1,c). In freeze-fracture replicas, the particles of control lens junctions are more loosely packed than those of typical gap junctions (Fig. 1,a) and crystallize, when exposed to uncoupling agents such as Ca++, or H+, into pseudo-hexagonal, rhombic (Fig. 1,b) and orthogonal arrays with a particle-to-particle spacing of 6.5 nm. Because of these differences, questions have been raised about the interpretation of the lens junctions as communicating junctions, in spite of the fact that they are the only junctions interlinking lens fiber cells.

A survey of orthogonal arrays of strength two

1995 ◽  
Vol 11 (3) ◽  
pp. 308-317
Author(s):  
Zhangwen Liu ◽  
Fujii Yoshio
Keyword(s):  
Orthogonal Arrays
Sign in / Sign up

Export Citation Format

Share Document