Orthogonal Arrays of Index Unity
From MaRDI portal
Publication:5812203
DOI10.1214/aoms/1177729387zbMath0047.01704OpenAlexW2084035360MaRDI QIDQ5812203
Publication date: 1952
Published in: The Annals of Mathematical Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aoms/1177729387
Related Items (only showing first 100 items - show all)
On encoding symbol degrees of array BP-XOR codes ⋮ Problems and algorithms for covering arrays ⋮ On orthogonal arrays of strength 3 and 5 achieving Rao's bound ⋮ A flexible image cipher based on orthogonal arrays ⋮ Further investigations on balanced arrays ⋮ A characterization of MDS codes that have an error correcting pair ⋮ Ideal ramp schemes and augmented orthogonal arrays ⋮ A combinatorial error bound for \(t\)-point-based sampling ⋮ Orthogonal and partially balanced arrays and their application in design of experiments ⋮ Slight improvements of the Singleton bound ⋮ A construction for orthogonal arrays with strength \(t\geq 3\) ⋮ The test suite generation problem: optimal instances and their implications ⋮ Resolvable generalized difference matrices: existence and applications ⋮ Observability of lattice graphs ⋮ Some distribution numbers of the hypercubic association scheme ⋮ Construction of multi-level supersaturated design via Kronecker product ⋮ Cyclic orthogonal and balanced arrays ⋮ On difference schemes and orthogonal arrays of strength \(t\) ⋮ On M.D.S. codes, arcs in PG(n,q) with q even, and a solution of three fundamental problems of B. Segre ⋮ Stochastic gradient processes: A survey of convergence theory using Lyapunov second method ⋮ Unnamed Item ⋮ On two-weight codes ⋮ An approach of constructing mixed-level orthogonal arrays of strength \(\geqslant 3\) ⋮ Improved bounds for separating hash families ⋮ Covering arrays on product graphs ⋮ Incomplete orthogonal arrays and idempotent orthogonal arrays ⋮ Multimagic rectangles based on large sets of orthogonal arrays ⋮ Algebraic theory of block codes detecting independent errors ⋮ On the existence of orthogonal arrays OA\((3,5,4n+2)\) ⋮ A construction for \(t\)-fold perfect authentication codes with arbitration ⋮ Consecutive detecting arrays for interaction faults ⋮ Constructing heterogeneous hash families by puncturing linear transversal designs ⋮ Construction of asymmetric orthogonal arrays through finite geometries. ⋮ Constructing new covering arrays from LFSR sequences over finite fields ⋮ Detecting arrays and their optimality ⋮ A greedy-metaheuristic 3-stage approach to construct covering arrays ⋮ On sets of vectors of a finite vector space in which every subset of basis size is a basis ⋮ Further results on the existence of nested orthogonal arrays ⋮ Quantum \(k\)-uniform states for heterogeneous systems from irredundant mixed orthogonal arrays ⋮ An existence theorem for group divisible 3-designs of large order ⋮ A greedy algorithm to construct covering arrays using a graph representation ⋮ Finite field constructions of combinatorial arrays ⋮ Doubly resolvable Steiner quadruple systems of orders \(2^{2n+1}\) ⋮ On sets of vectors of a finite vector space in which every subset of basis size is a basis. II ⋮ MDS constacyclic codes of prime power lengths over finite fields and construction of quantum MDS codes ⋮ Super-simple balanced incomplete block designs with block size 5 and index 3 ⋮ A unified approach to combinatorial key predistribution schemes for sensor networks ⋮ Small matrices of large dimension ⋮ On Rosenbloom and Tsfasman's generalization of the Hamming space ⋮ The equivalence between optimal detecting arrays and super-simple OAs ⋮ Completely reducible super-simple designs with block size five and index two ⋮ On the construction of \(q\)-ary equidistant codes ⋮ Almost MDS codes ⋮ Covering array EXtender ⋮ A two-stage algorithm for combinatorial testing ⋮ Optimum super-simple mixed covering arrays of type \(a^1 b^{k-1}\) ⋮ Existence of super-simple \(\mathrm{OA}_\lambda (3,5,v)\)'s ⋮ A tight bound for frameproof codes viewed in terms of separating hash families ⋮ Constructions of new orthogonal arrays and covering arrays of strength three ⋮ Expansive automata networks ⋮ Super-simple \((5, 4)\)-GDDs of group type \(g^u\) ⋮ A trigonometric approach to quaternary code designs with application to one-eighth and one-sixteenth fractions ⋮ New covering array numbers ⋮ On maximal (k,t)-sets ⋮ Correction note otto 'On maximal (k,t)-sets' ⋮ Covering and radius-covering arrays: constructions and classification ⋮ On two level symmetrical factorial designs ⋮ A construction of variable strength covering arrays ⋮ Inclusion matrices and the MDS conjecture ⋮ Optimal and near-optimal mixed covering arrays by column expansion ⋮ On proper secrets, \((t,k)\)-bases and linear codes ⋮ A characterization of some \([n,k,d;q\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry] ⋮ A construction of some \([n,k,d;q\)-codes meeting the Griesmer bound] ⋮ A vector-space packing problem ⋮ Constructing ordered orthogonal arrays via sudoku ⋮ Unbalanced Hadamard matrices and finite projective planes of even order ⋮ Permanents of d-dimensional matrices ⋮ On schematic orthogonal arrays \(OA(q^ t,k,q,t)\) ⋮ Factorials experiments, covering arrays, and combinatorial testing ⋮ Application of orthogonal arrays and MARS to inventory forecasting stochastic dynamic programs. ⋮ Optimality and constructions of locating arrays ⋮ Constructions of optical orthogonal codes based on cyclic \(t\)-wise quasi-difference matrices ⋮ On maximal \(t\)-linearly independent sets ⋮ On \((t, L)\)-fold perfect authentication and secrecy codes with arbitration ⋮ Further results on 2-uniform states arising from irredundant orthogonal arrays ⋮ On arrays with some combinatorial structure ⋮ Maximal sets of points in finite projective space, no t-linearly dependent ⋮ The packing problem in statistics, coding theory and finite projective spaces ⋮ Problems and algorithms for covering arrays via set covers ⋮ A survey on the problems and algorithms for covering arrays via set covers ⋮ A study of orthogonal arrays from the point of view of design theory ⋮ On some optimal fractional \(2^ m \)factorial designs of resolution V ⋮ Quantum MDS and synchronizable codes from cyclic and negacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m}\) ⋮ On the nonexistence of certain M.D.S. codes and projective planes ⋮ Large Sets of Orthogonal Arrays and Multimagic Squares ⋮ The existence theorem for group divisible designs of large order ⋮ On incomplete orthogonal arrays ⋮ Some new 2-resolvable Steiner quadruple systems ⋮ Optimum detecting arrays for independent interaction faults ⋮ Heuristically enhanced IPO algorithms for covering array generation
This page was built for publication: Orthogonal Arrays of Index Unity
