Related papers: Constructions of Augmented Orthogonal Arrays
An $[n,k,d]$ linear code is said to be maximum distance separable (MDS) or almost maximum distance separable (AMDS) if $d=n-k+1$ or $d=n-k$, respectively. If a code and its dual code are both AMDS, then the code is said to be near maximum…
Antenna arrays have many applications in direction-of-arrival (DOA) estimation. Sparse arrays such as nested arrays, super nested arrays, and coprime arrays have large degrees of freedom (DOFs). They can estimate large number of sources…
It was recently found that there are very close connections between the existence of additive spanners (subgraphs where all distances are preserved up to an additive stretch), distance preservers (subgraphs in which demand pairs have their…
A geometric $t$-spanner on a set of points in Euclidean space is a graph containing for every pair of points a path of length at most $t$ times the Euclidean distance between the points. Informally, a spanner is $\mathcal{O}(k)$-robust if…
We present an algorithm for planning trajectories that avoid obstacles and satisfy key-door precedence specifications expressed with a fragment of signal temporal logic. Our method includes a novel exact convex partitioning of the obstacle…
Quantum multipartite entangled states play significant roles in quantum information processing. By using difference schemes and orthogonal partitions, we construct a series of infinite classes of irredundant mixed orthogonal arrays (IrMOAs)…
Associated varieties are geometric objects appearing in infinite-dimensional representations of semisimple Lie algebras (groups). By applying Fourier transformations to the natural orthogonal oscillator representations of special linear Lie…
For a $k$-uniform hypergraph $G$ with vertex set $\{1,\ldots,n\}$, the ordered Ramsey number $\operatorname{OR}_t(G)$ is the least integer $N$ such that every $t$-coloring of the edges of the complete $k$-uniform graph on vertex set…
In this paper, we introduce a family of novel sparse array designs called the augmented ULAs (AULAs) for the localization of non-circular signals (NCS). Accurate direction of arrival (DOA) estimation and the ability to resolve multiple…
We study the classes of $(u,m,{\bf e},s)$-nets and $(u,{\bf e},s)$-sequences, which are generalizations of $(u,m,s)$-nets and $(u,s)$-sequences, respectively. We show equivalence results that link the existence of $(u,m,{\bf e},s)$-nets and…
Overlays were introduced by R. H. Fox [6] as a subclass of covering maps. We offer a different view of overlays: it resembles the definition of paracompact spaces via star refinements of open covers. One introduces covering structures for…
We study the problem of inferring a sparse vector from random linear combinations of its components. We propose the Accelerated Orthogonal Least-Squares (AOLS) algorithm that improves performance of the well-known Orthogonal Least-Squares…
Sum-rank metric codes, as a generalization of Hamming codes and rank metric codes, have important applications in fields such as multi-shot linear network coding, space-time coding and distributed storage systems. The purpose of this study…
The study of optical orthogonal codes has been motivated by an application in an optical code-division multiple access system. This paper focuses on optimal two-dimensional optical orthogonal codes with autocorrelation and cross-correlation…
In 2020, Cameron et al. introduced the restricted numerical range of a digraph (directed graph) as a tool for characterizing digraphs and studying their algebraic connectivity. In particular, digraphs with a restricted numerical range of a…
Traditional orthogonal range problems allow queries over a static set of points, each with some value. Dynamic variants allow points to be added or removed, one at a time. To support more powerful updates, we introduce the Grid Range class…
This work shows several direct and recursive constructions of ordered covering arrays using projection, fusion, column augmentation, derivation, concatenation and cartesian product. Upper bounds on covering codes in NRT spaces are also…
Sparse arrays can generate a larger aperture than traditional uniform linear arrays (ULA) and offer enhanced degrees-of-freedom (DOFs) which can be exploited in both beamforming and direction-of-arrival (DOA) estimation. One class of sparse…
A linear code with parameters $[n, k, n - k + 1]$ is called maximum distance separable (MDS), and one with parameters $[n, k, n - k]$ is called almost MDS (AMDS). A code is near-MDS (NMDS) if both it and its dual are AMDS. NMDS codes…
In SoCG 2022, Conroy and T\'oth presented several constructions of sparse, low-hop spanners in geometric intersection graphs, including an $O(n\log n)$-size 3-hop spanner for $n$ disks (or fat convex objects) in the plane, and an $O(n\log^2…