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

In this article we prove a necessary and a sufficient condition for a finite subset of the special linear group to be dominated. These conditions are purely geometric in nature, as they only involve the trace and the eigenvectors of the…

In this paper, we extend a necessary and sufficient condition for a linear code over a Galois ring to be minimal and establish new bounds on the length of an $m$-dimensional minimal linear code. Building upon this structural…

A linear code is called an MDS self-dual code if it is both an MDS code and a self-dual code with respect to the Euclidean inner product. The parameters of such codes are completely determined by the code length. In this paper, we consider…

This work deals with partial MDS (PMDS) codes, a special class of locally repairable codes, used for distributed storage system. We first show that a known construction of these codes, using Gabidulin codes, can be extended to use any…

We study the phenomenological viability of a constrained NMSSM with parameters subject to unified boundary conditions from F-theory GUTs. We find that very simple assumptions about modulus dominance SUSY breaking in F-theory unification…

This paper gives necessary and sufficient conditions for the Tanner graph of a quasi-cyclic (QC) low-density parity-check (LDPC) code based on the all-one protograph to have girth 6, 8, 10, and 12, respectively, in the case of parity-check…

We characterize the generator matrix in standard form of generalized Gabidulin codes. The parametrization we get for the non-systematic part of this matrix coincides with the $q$-analogue of generalized Cauchy matrices, leading to the…

This article introduces Generalized Hyperderivative Reed-Solomon codes (GHRS codes), which generalize NRT Reed-Solomon codes. Its main results are as follows: 1) every GHRS code is MDS, 2) the dual of a GHRS code is also an GHRS code, 3)…

Let $q=p^m$ be a prime power and $e$ be an integer with $0\leq e\leq m-1$. $e$-Galois self-dual codes are generalizations of Euclidean $(e=0)$ and Hermitian ($e=\frac{m}{2}$ with even $m$) self-dual codes. In this paper, for a linear code…

Without assuming that Higgs masses have the same values as other scalar masses at the input GUT scale, we combine constraints on the minimal supersymmetric extension of the Standard Model (MSSM) coming from the cold dark matter density with…

Hermitian hulls of linear codes are interesting for theoretical and practical reasons alike. In terms of recent application, linear codes whose hulls meet certain conditions have been utilized as ingredients to construct…

The path to the solution of Feder-Vardi dichotomy conjecture by Bulatov and Zhuk led through showing that more and more general algebraic conditions imply polynomial-time algorithms for the finite-domain Constraint Satisfaction Problems…

Twisted generalized Reed-Solomon (TGRS) codes are an extension of the generalized Reed-Solomon (GRS) codes by adding specific twists, which attract much attention recently. This paper presents an in-depth and comprehensive investigation of…

Let $H$, $T$ and $C_n$ be a graph, a tree and a cycle of order $n$, respectively. Let $H^{(i)}$ be the complete join of $H$ and an empty graph on $i$ vertices. Then the Cartesian product $H\Box T$ of $H$ and $T$ can be obtained by applying…

Universal security over a network with linear network coding has been intensively studied. However, previous linear codes and code pairs used for this purpose were linear over a larger field than that used on the network, which restricts…

Generalized Tanner graphs have been implicitly studied by a number of authors under the rubric of generalized parity-check matrices. This work considers the conditioning of binary hidden variables in such models in order to break all cycles…

We construct a general class of pseudo-Goldstone composite Higgs models, within the minimal SO(5)/SO(4) coset structure, that are not necessarily of moose-type. We characterize the main properties these models should have in order to give…

This article treats global uniform exponential stability (GUES) of discrete-time switched linear systems under restricted switching. Given admissible minimum and maximum dwell times, we provide sufficient conditions on the subsystems under…

A linear $ [n,k]_q $ code $ C $ is said to be a full weight spectrum (FWS) code if there exist codewords of each nonzero weight less than or equal to $ n $. In this brief communication we determine necessary and sufficient conditions for…

While deep generative models~(DGMs) have demonstrated remarkable success in capturing complex data distributions, they consistently fail to learn constraints that encode domain knowledge and thus require constraint integration. Existing…