相关论文: Optimal (v, 4, 2, 1) optical orthogonal codes with…

We consider the problem of existence of perfect $2$-colorings (equitable $2$-partitions) of Hamming graphs with given parameters. We start with conditions on parameters of graphs and colorings that are necessary for their existence. Next we…

Oriented chromatic number of an oriented graph $G$ is the minimum order of an oriented graph $H$ such that $G$ admits a homomorphism to $H$. The oriented chromatic number of an unoriented graph $G$ is the maximal chromatic number over all…

Using the method for constructing binary self-dual codes with an automorphism of order square of a prime number we have classified all binary self-dual codes with length 76 having minimum distance $d=14$ and automorphism of order 9. Up to…

In this paper we define the concept of orthogonality between two factors "through another factor". Exploiting this property we have been able to obtain orthogonal main effect plans (OMEP) on non-orthogonal blocks requiring considerably…

The purpose of this paper is to complete the classification of binary self-dual [48,24,10] codes with an automorphism of odd prime order. We prove that if there is a self-dual [48, 24, 10] code with an automorphism of type p-(c,f) with p…

Linear Complementary Dual codes (LCD) are binary linear codes that meet their dual trivially. We construct LCD codes using orthogonal matrices, self-dual codes, combinatorial designs and Gray map from codes over the family of rings $R_k$.…

For prime powers q we use "strongly orthogonal" linear Sudoku solutions of order q^2 to construct ordered orthogonal arrays of type OOA (4,s,2,q), and for each q we present a range of values of s for which these constructions are valid.

We analytically study the Out-of-Time-Order Correlation functions (OTOC) for two spatially separated primary operators in two-dimensional unitary minimal models. Besides giving general arguments using the conformal symmetry, we also use the…

In this paper, we prove existence of optimal complementary dual codes (LCD codes) over large finite fields. We also give methods to generate orthogonal matrices over finite fields and then apply them to construct LCD codes. Construction…

Several classes of irreducible orthogonal representations of compact Lie groups that are of importance in Differential Geometry have the property that the second osculating spaces of all of their nontrivial orbits coincide with the…

We have found the most general extension of the celebrated Sauer, Perles and Shelah, Vapnik and Chervonenkis result from 0-1 sequences to $k$-ary codes still giving a polynomial bound. Let $\mathcal{C}\subseteq \{0,1,..., k-1}^n$ be a…

In this paper, we introduce further our recently designed family of L2 orthogonal Space-Time codes for CPM. With their advantage of maintaining both the constant envelope properties of CPM, the diversity of Space-Time codes and moreover…

The optical vortex coronagraph (OVC) is one of the promising ways for direct imaging exoplanets because of its small inner working angle and high throughput. This paper presents the design and laboratory demonstration performance at 633nm…

In the vertex cover problem, the input is a graph $G$ and an integer $k$, and the goal is to decide whether there is a set of vertices $S$ of size at most $k$ such that every edge of $G$ is incident on at least one vertex in $S$. We study…

Let $n_g(k)$ denote the smallest order of a $k$-chromatic graph of girth at least $g$. We consider the problem of determining $n_g(k)$ for small values of $k$ and $g$. After giving an overview of what is known about $n_g(k)$, we provide…

As a subclass of linear codes, cyclic codes have efficient encoding and decoding algorithms, so they are widely used in many areas such as consumer electronics, data storage systems and communication systems. In this paper, we give a…

Space-Time block codes (STBC) from Orthogonal Designs (OD) and Co-ordinate Interleaved Orthogonal Designs (CIOD) have been attracting wider attention due to their amenability for fast (single-symbol) ML decoding, and full-rate with…

We consider coding schemes for computationally bounded channels, which can introduce an arbitrary set of errors as long as (a) the fraction of errors is bounded with high probability by a parameter $p$ and (b) the process which adds the…

We introduce a stochastic coordinate extension of the first-order primal-dual method studied by Cohen and Zhu (1984) and Zhao and Zhu (2018) to solve Composite Optimization with Composite Cone-constraints (COCC). In this method, we randomly…

We show that several problems of compacting orthogonal graph drawings to use the minimum number of rows, area, length of longest edge or total edge length cannot be approximated better than within a polynomial factor of optimal in…