Related papers: Pseudo Quasi-3 Designs and their Applications to C…
This paper is devoted to studying difference indices of quasi-prime difference algebraic systems. We define the quasi dimension polynomial of a quasi-prime difference algebraic system. Based on this, we give the definition of the difference…
Quasi-polycyclic (QP for short) codes over a finite chain ring $R$ are a generalization of quasi-cyclic codes, and these codes can be viewed as an $R[x]$-submodule of $\mathcal{R}_m^{\ell}$, where $\mathcal{R}_m:= R[x]/\langle f\rangle$,…
In this work, we study a class of generalized quasi-cyclic (GQC) codes called skew GQC codes. By the factorization theory of ideals, we give the Chinese Remainder Theorem over the skew polynomial ring, which leads to a canonical…
Quasi-one-dimensional quantum structures with spectra scaling faster than the square of the eigenmode number (superscaling) can generate intrinsic, off-resonant optical nonlinearities near the fundamental physical limits, independent of the…
LCD codes are linear codes that intersect with their dual trivially. Quasi cyclic codes that are LCD are characterized and studied by using their concatenated structure. Some asymptotic results are derived. Hermitian LCD codes are…
The dimension of a block design is the maximum positive integer $d$ such that any $d$ of its points are contained in a proper subdesign. Pairwise balanced designs PBD$(v,K)$ have dimension at least two as long as not all points are on the…
We give some new explicit examples of putatively optimal projective spherical designs. i.e., ones for which there is numerical evidence that they are of minimal size. These form continuous families, and so have little apparent symmetry in…
A flag is a sequence of nested subspaces of a given ambient space F_q^n over a finite field F_q. In network coding, a flag code is a set of flags, all of them with the same sequence of dimensions, the type vector. In this paper, we…
We use quasi-orders to describe the structure of C-groups. We do this by associating a quasi-order to each compatible C-relation of a group, and then give the structure of such quasi-ordered groups. We also reformulate in terms of…
Based on cyclic simplex codes, a new construction of a family of 2-generator quasi-cyclic two-weight codes is given. New optimal binary quasi-cyclic [195, 8, 96], [210, 8, 104] and [240, 8, 120] codes, good QC ternary [195, 6, 126], [208,…
We introduce the notion of a quasi DG category, generalizing that of a DG category. To a quasi DG category satisfying certain additional conditions, we associate another quasi DG category, the quasi DG category of $C$-diagrams. We then show…
The deformed supersymmetric sine-Gordon model, obtained through known deformation of the corresponding potential, is found to be quasi-integrable, like its non-supersymmetric counterpart, which was observed earlier. The system expectedly…
We define quasiconvex programming, a form of generalized linear programming in which one seeks the point minimizing the pointwise maximum of a collection of quasiconvex functions. We survey algorithms for solving quasiconvex programs either…
Using the technique of quasi difference sets we characterize geometry and automorphisms of configurations which can be presented as a join of some others, in particular - which can be presented as series of cyclically inscribed copies of…
We define a notion of a rotund quasi-uniform space and describe a new direct construction of a (right-continuous) quasi-pseudometric on a (rotund) quasi-uniform space. This new construction allows to give alternative proofs of several…
I give an elementary proof that a quasi-symmetric design without repeated blocks on $v$ points has at most $v\choose2$ blocks, with equality if and only if it is a tight $4$-design.
In this paper we define a family of theories, quasi-theories, motivated by quasi-elliptic cohomology. They can be defined from constant loop spaces. With them, the constructions on certain theories can be made in a neat way, such as those…
In this paper we investigate the structure of quasi-BCH codes. In the first part of this paper we show that quasi-BCH codes can be derived from Reed-Solomon codes over square matrices extending the known relation about classical BCH and…
We describe the quasi-isometric classification of fundamental groups of irreducible non-geometric 3-manifolds which do not have "too many" arithmetic hyperbolic geometric components, thus completing the quasi-isometric classification of…
We introduce the first example of algebraically constructed hierarchical quasi-cyclic codes. These codes are built from Reed-Solomon codes using a 1964 construction of superimposed codes by Kautz and Singleton. We show both the number of…