Orthogonal Arrays of Index Unity

Cited in

(only showing first 100 items - show all)

On some optimal fractional 2^ m factorial designs of resolution V
On the nonexistence of certain M.D.S. codes and projective planes
On incomplete orthogonal arrays
On orthogonal arrays of strength 3 and 5 achieving Rao's bound
Some distribution numbers of the hypercubic association scheme
On M.D.S. codes, arcs in PG(n,q) with q even, and a solution of three fundamental problems of B. Segre
Algebraic theory of block codes detecting independent errors
Small matrices of large dimension
On maximal (k,t)-sets
Correction note otto 'On maximal (k,t)-sets'
On two level symmetrical factorial designs
Application of orthogonal arrays and MARS to inventory forecasting stochastic dynamic programs.
The packing problem in statistics, coding theory and finite projective spaces
Some new 2-resolvable Steiner quadruple systems
A construction for orthogonal arrays with strength t 3
Cyclic orthogonal and balanced arrays
On difference schemes and orthogonal arrays of strength t
Construction of asymmetric orthogonal arrays through finite geometries.
The existence theorem for group divisible designs of large order
Ideal ramp schemes and augmented orthogonal arrays
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
Permanents of d-dimensional matrices
On schematic orthogonal arrays \(OA(q^ t,k,q,t)\)
On arrays with some combinatorial structure
Maximal sets of points in finite projective space, no t-linearly dependent
Problems and algorithms for covering arrays
A combinatorial error bound for \(t\)-point-based sampling
Slight improvements of the Singleton bound
Stochastic gradient processes: A survey of convergence theory using Lyapunov second method
Incomplete orthogonal arrays and idempotent orthogonal arrays
Detecting arrays and their optimality
Further results on the existence of nested orthogonal arrays
Expansive automata networks
New covering array numbers
A construction of variable strength covering arrays
Factorials experiments, covering arrays, and combinatorial testing
Further results on 2-uniform states arising from irredundant orthogonal arrays
Quantum MDS and synchronizable codes from cyclic and negacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m}\)
Heuristically enhanced IPO algorithms for covering array generation
A flexible image cipher based on orthogonal arrays
Consecutive detecting arrays for interaction faults
A greedy-metaheuristic 3-stage approach to construct covering arrays
A greedy algorithm to construct covering arrays using a graph representation
Doubly resolvable Steiner quadruple systems of orders \(2^{2n+1}\)
MDS constacyclic codes of prime power lengths over finite fields and construction of quantum MDS codes
Covering array EXtender
Existence of super-simple \(\mathrm{OA}_\lambda (3,5,v)\)'s
A tight bound for frameproof codes viewed in terms of separating hash families
Super-simple \((5, 4)\)-GDDs of group type \(g^u\)
Optimality and constructions of locating arrays
Constructions of optical orthogonal codes based on cyclic \(t\)-wise quasi-difference matrices
On \((t, L)\)-fold perfect authentication and secrecy codes with arbitration
Problems and algorithms for covering arrays via set covers
A survey on the problems and algorithms for covering arrays via set covers
Further investigations on balanced arrays
The test suite generation problem: optimal instances and their implications
On sets of vectors of a finite vector space in which every subset of basis size is a basis
An existence theorem for group divisible 3-designs of large order
Super-simple balanced incomplete block designs with block size 5 and index 3
A unified approach to combinatorial key predistribution schemes for sensor networks
On Rosenbloom and Tsfasman's generalization of the Hamming space
A vector-space packing problem
Unbalanced Hadamard matrices and finite projective planes of even order
Optimum detecting arrays for independent interaction faults
On maximal t-linearly independent sets
Orthogonal and partially balanced arrays and their application in design of experiments
Construction of multi-level supersaturated design via Kronecker product
On two-weight codes
On encoding symbol degrees of array BP-XOR codes
Quantum \(k\)-uniform states for heterogeneous systems from irredundant mixed orthogonal arrays
Linear recursive MDS-codes and Asturian codes
Constructing ordered orthogonal arrays via sudoku
A characterization of MDS codes that have an error correcting pair
Large sets of orthogonal arrays and multimagic squares
MiTS in Depth: An Analysis of Distinct Tabu Search Configurations for Constructing Mixed Covering Arrays
Hyper-rook Domain Inequalities
Construction of logarithm tables for Galois fields
Resolvable generalized difference matrices: existence and applications
On the Construction of Sets of Mutually Orthogonal Latin Squares and the Falsity of a Conjecture of Euler
Observability of lattice graphs
A General Product Construction for Error Correcting Codes
A note on an upper bound for the constraints of balancedarrays with strength t
Generalization of Siegenthaler inequality and Schnorr-Vaudenay multipermutations
An approach of constructing mixed-level orthogonal arrays of strength 3
Improved bounds for separating hash families
Multimagic rectangles based on large sets of orthogonal arrays
A construction for \(t\)-fold perfect authentication codes with arbitration
Constructing heterogeneous hash families by puncturing linear transversal designs
On the construction of orthogonal factorial designs of resolution 11
On sets of vectors of a finite vector space in which every subset of basis size is a basis. II
scientific article; zbMATH DE number 1512990 (Why is no real title available?)
New optimal covering arrays using an orderly algorithm
Existence Theorems for Matroid Designs
Mixed orthogonal arrays, \(k\)-dimensional \(M\)-part Sperner multifamilies, and full multitransversals
Completely reducible super-simple designs with block size five and index two
Quantum combinatorial designs and \(k\)-uniform states
A two-stage algorithm for combinatorial testing
Optimum super-simple mixed covering arrays of type \(a^1 b^{k-1}\)
A scientific tour on orthogonal arrays

This page was built for publication: Orthogonal Arrays of Index Unity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5812203)