Related papers: Nonexistence of a few binary orthogonal arrays
Nonparametric detection of existence of an anomalous structure over a network is investigated. Nodes corresponding to the anomalous structure (if one exists) receive samples generated by a distribution q, which is different from a…
Minimum distance is an important parameter of a linear error correcting code. For improved performance of binary Low Density Parity Check (LDPC) codes, we need to have the minimum distance grow fast with n, the codelength. However, the best…
DISCLAIMER: Due to an error in the literature, we cannot be sure that the conclusions drawn in this paper are correct. The goal of this note is to connect some interesting results in the literature on algebraic graph theory and finite…
In modern data storage systems, non-binary LDPC codes for recovering from disk failures are increasingly considered strong competitors to MDS codes such as Reed-Solomon codes. Since disk failures can be modeled as erasures, we analyze…
Observations of exoplanets and protoplanetary disks show that binary stellar systems can host planets in stable orbits. Given the high binary fraction among stars, the contribution of binary systems to Galactic habitability should be…
I study partial identification of distributional parameters in triangular systems. This model consists of a nonparametric outcome equation and a selection equation. This allows for general unobserved heterogeneity and selection on…
Some mutually quasi-unbiased weighing matrices are constructed from binary codes satisfying certain conditions. Motivated by this, in this note, we study binary codes satisfying the conditions. The weight distributions of binary codes…
Representing visual data using compact binary codes is attracting increasing attention as binary codes are used as direct indices into hash table(s) for fast non-exhaustive search. Recent methods show that ranking binary codes using…
High order networks are weighted hypergraphs col- lecting relationships between elements of tuples, not necessarily pairs. Valid metric distances between high order networks have been defined but they are difficult to compute when the…
The task of the binary classification problem is to determine which of two distributions has generated a length-$n$ test sequence. The two distributions are unknown; two training sequences of length $N$, one from each distribution, are…
Binaries are excellent astrophysical laboratories that provide us with direct measurements of fundamental stellar parameters. Compared to single isolated star, multiplicity induces new processes, offering the opportunity to confront our…
Linear codes are widely studied due to their applications in communication, cryptography, quantum codes, distributed storage and many other fields. In this paper, we use the trace and norm functions over finite fields to construct a family…
We show that there exist ordered orthogonal arrays, whose sizes deviate from the Rao bound by a factor that is polynomial in the parameters of the ordered orthogonal array. The proof is nonconstructive and based on a probabilistic method…
The nonparametric problem of detecting existence of an anomalous interval over a one dimensional line network is studied. Nodes corresponding to an anomalous interval (if exists) receive samples generated by a distribution q, which is…
The possibility of excitations with fractional spin and statististics in $1+1$ dimensions is explored. The configuration space of a two-particle system is the half-line. This makes the Hamiltonian self-adjoint for a family of boundary…
We show that for two afii varieties over an arbitrary field of characteristic zero, there is no general form of an algorithm for checking the presence of an embedding of one algebraic variety in another. Moreover, we establish this for…
DeTurck and Yang have shown that in the neighbourhood of every point of a $3$-dimensional Riemannian manifold, there exists a system of orthogonal coordinates (that is, whith respect to which the metric has diagonal form). We show that this…
Orthogonal array, a classical and effective tool for collecting data, has been flourished with its applications in modern computer experiments and engineering statistics. Driven by the wide use of computer experiments with both qualitative…
Orthogonal Fractional Factorial Designs and in particular Orthogonal Arrays are frequently used in many fields of application, including medicine, engineering and agriculture. In this paper we present a methodology and an algorithm to find…
We consider the problem of estimating the context tree of a stationary ergodic process with finite alphabet without imposing additional conditions on the process. As a starting point we introduce a Hamming metric in the space of irreducible…