Simplicity conditions for binary orthogonal arrays
From Rao's theorem [\textit{A. S. Hedayat} et al., Orthogonal arrays. Theory and applications. New York, NY: Springer (1999; Zbl 0935.05001), Theorem 2.1], every orthogonal array of \(N\) rows, \(k\) columns, \(s\) symbols, and strength \(2u\) satisfies that \[ N\geq M(k,s,2u):=\sum_{j=0}^u\binom kj (s-1)^j. \] Let \(F(k,s,t)\) denote the minimum positive integer \(N\) such that an orthogonal array of \(N\) rows, \(k\) columns, \(s\) symbols, and strength \(t\) exists. In the case of dealing only with simple orthogonal arrays (that is, orthogonal arrays with pairwise distinct rows), this number is denoted \(F^\ast (k,s,t)\). In this paper, the authors prove that, if \(t=2u\) and \(N < 2 M(k, s, 2u)\), then the orthogonal array under consideration is simple. As a consequence, if \(t\) is even, then \(F^\ast (k,s,t)=F(k,s,t)\), whenever \(F(k,s,t)< 2 M(k, s, t)\). This result is used by the authors for determining the value \(F^\ast (k,2,t)\), for \(t\in \{2,3\}\). It implies in turn that the minimum Hamming weight of 2-CI Boolean functions is a monotone non-decreasing function when \(k\) grows. The same statement, for \(t\in\{4,5\}\), is partially dealt with.
- scientific article; zbMATH DE number 4172916
- Hamming weights of correlation immune Boolean functions
- Maximum cellular boolean functions and perfect gray codes
- A geometric approach to finding new lower bounds of A(n,d,w)
- Orthogonal vectors in the n-dimensional cube and codes with missing distances
- Counting Balanced Boolean Functions innVariables with Bounded Degree
- Efficient design methods of low-weight correlation-immune functions and revisiting their basic characterization
- Nonexistence of a few binary orthogonal arrays
- scientific article; zbMATH DE number 3877187
- Computing Distance Distributions of Ternary Orthogonal Arrays
- A bound on correlation immunity
- A class of low-rate nonlinear binary codes
- A spectral characterization of correlation-immune combining functions
- Boolean functions for cryptography and coding theory
- Bounds on orthogonal arrays and resilient functions
- Classification of orthogonal arrays by integer programming
- Complete enumeration of pure-level and mixed-level orthogonal arrays
- Estimates of the capacity of orthogonal arrays of large strength
- Hadamard matrices, \(d\)-linearly independent sets and correlation-immune Boolean functions with minimum Hamming weights
- scientific article; zbMATH DE number 6900649 (Why is no real title available?)
- scientific article; zbMATH DE number 3048068 (Why is no real title available?)
- Nonexistence of a few binary orthogonal arrays
- On the \(\mathrm{OA}(1536,13,2,7)\) and related orthogonal arrays
- On the nonexistence of certain orthogonal arrays of strength four
- Orthogonal arrays. Theory and applications
- Estimates of the capacity of orthogonal arrays of large strength
- On the nonexistence of certain orthogonal arrays of strength four
- Simplicity conditions for binary orthogonal arrays
- Construction of balanced sliced orthogonal arrays
- On the construction of nested orthogonal arrays with the adjacent numbers of levels
This page was built for publication: Simplicity conditions for binary orthogonal arrays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2678983)
