相关论文: GHW-based Necessary and Sufficient Conditions for …

Very recently, Heng et al. studied a family of extended primitive cyclic codes. It was shown that the supports of all codewords with any fixed nonzero Hamming weight of this code supporting 2-designs. In this paper, we study this family of…

We make a detailed analysis on validity of gauge-fixing conditions and the structure of propagators in the Wess-Zumino-Witten-type open superstring field theory. First, we generalize the gauge-fixing conditions considered in JHEP 03 (2012)…

We construct six new explicit families of linear maximum sum-rank distance (MSRD) codes, each of which has the smallest field sizes among all known MSRD codes for some parameter regime. Using them and a previous result of the author, we…

Codes from generalized Hadamard matrices have already been introduced. Here we deal with these codes when the generalized Hadamard matrices are cocyclic. As a consequence, a new class of codes that we call generalized Hadamard full…

Motivated by an application to database linear querying, such as private information-retrieval protocols, we suggest a fundamental property of linear codes -- the generalized covering radius. The generalized covering-radius hierarchy of a…

We discuss the phenomenology of charged Higgs bosons in the MSSM with minimal flavor violation. In addition to the constrained MSSM (CMSSM) with universal soft supersymmetry breaking mass parameters at the GUT scale, we explore…

A set $S\subseteq \re^n$ is called to be {\it Semidefinite (SDP)} representable if $S$ equals the projection of a set in higher dimensional space which is describable by some Linear Matrix Inequality (LMI). The contributions of this paper…

The $MLS$ conjecture states that every finite simple group has a minimal logarithmic signature. The aim of this paper is proving the existence of a minimal logarithmic signature for some simple unitary groups $PSU_{n}(q)$. We report a gap…

In this work, a unique set of generators for a cyclic code over a finite chain ring has been established. The minimal spanning set and rank of the code have also been determined. Further, sufficient as well as necessary conditions for a…

A new gauge driver is introduced for the generalized harmonic (GH) representation of Einstein's equation. This new driver allows a rather general class of gauge conditions to be implemented in a way that maintains the hyperbolicity of the…

In a recent work [2] with Datta, we introduced the mu vector (with respect to a given field) of simplicial complexes and used it to study tightness and lower bounds. In this paper, we modify the definition of mu vectors. With the new…

We present an analysis of well-posedness of constrained evolution of 3+1 formulations of GR. In this analysis we explicitly take into account the energy and momentum constraints as well as possible algebraic constraints on the evolution of…

We give a new proof of Delsarte, Goethals and Mac williams theorem on minimal weight codewords of generalized Reed-Muller codes published in 1970. To prove this theorem, we consider intersection of support of minimal weight codewords with…

Generalized bicycle (GB) codes is a class of quantum error-correcting codes constructed from a pair of binary circulant matrices. Unlike for other simple quantum code ans\"atze, unrestricted GB codes may have linear distance scaling. In…

Let $G$ be a graph with a perfect matching. Denote by $f(G)$ the minimum size of a matching in $G$ which is uniquely extendable to a perfect matching in $G$. Diwan (2019) proved by linear algebra that for $d$-hypercube $Q_d$ ($d\geq 2)$,…

We quantify precisely the distribution of the output of a binary random number generator (RNG) after conditioning with a binary linear code generator matrix by showing the connection between the Walsh spectrum of the resulting random…

The minimal supersymmetric standard model (MSSM) is extended by including an additional pair of constrained Higgs doublet superfields through which the electroweak symmetry is nonlinearly realized. The superpotential couplings of this…

In their seminal paper from 2004, Kuhn, Moscibroda, and Wattenhofer (KMW) proved a hardness result for several fundamental graph problems in the LOCAL model: For any (randomized) algorithm, there are input graphs with $n$ nodes and maximum…

Gravitational waves (GWs) are one of the key signatures of cosmic strings. If GWs from cosmic strings are detected in future experiments, not only their existence can be confirmed but also their properties might be probed. In this paper, we…

The Minimal Supersymmetric SO(10) GUT has developed into a fully realistic theory in which not only are the gauge couplings unified but the known fermion spectrum and mixing matrices could fit accurately using the latitude introduced by…