相关论文: Singly-even self-dual codes with minimal shadow

From a given $[n, k]$ code $C$, we give a method for constructing many $[n, k]$ codes $C'$ such that the hull dimensions of $C$ and $C'$ are identical. This method can be applied to constructions of both self-dual codes and linear…

Singular or weak solutions of the incompressible Euler equations have been hypothesized to account for anomalous dissipation at very high Reynolds numbers and, in particular, to explain the d'Alembert paradox of non-vanishing drag. A…

We compute families of solutions to the Einstein vacuum equations of the type of Brill waves, but with slow fall-off towards spatial infinity. We prove existence and uniqueness of solutions for physical data and numerically construct some…

We investigate gravitational effects of extreme, non-extreme and ultra- extreme domain walls in the presence of a dilaton field. The dilaton is a scalar field without self-interaction that couples to the matter po- tential that is…

In this paper we investigate codes over finite commutative rings R, whose generator matrices are built from \$\alpha\$-circulant matrices. For a non-trivial ideal I<R we give a method to lift such codes over R/I to codes over R, such that…

Binary cyclic codes have been a hot topic for many years, and significant progress has been made in the study of this types of codes. As is well known, it is hard to construct infinite families of binary cyclic codes [n, n+1/2] with good…

Using some nonlinear domain decomposition method, we prove the existence of singular limits for solution of semilinear elliptic problems with exponential nonlinearity.

In this article we consider linear codes coming from skew-symmetric determinantal varieties, which are defined by the vanishing of minors of a certain fixed size in the space of skew-symmetric matrices. In odd characteristic, the minimum…

In this paper we carefully study the MSE performance of the linear analog codes. We have derived a lower bound of the MSE performance under Likelihood(ML) and Linear Minimal Mean Square Error(LMMSE) decoding criteria respectively. It is…

We study the asymptotics of large simple graphs constrained by the limiting density of edges and the limiting subgraph density of an arbitrary fixed graph $H$. We prove that, for all but finitely many values of the edge density, if the…

We give a complete characterization of simple graphs whose adjacency matrices generate binary linear complementary dual (LCD) codes. In particular, we completely characterize a distance-regular graph which yields an LCD code in terms of the…

Given a hypergraph $\mathcal{H}$, we introduce a new class of evaluation toric codes called edge codes derived from $\mathcal{H}$. We analyze these codes, focusing on determining their basic parameters. We provide estimations for the…

It is proved in a reference (Fan, Lin, IEEE TIT, vol.67, pp.5016-5025) that the self-dual (LCD respectively) dihedral codes over a finite field~$F$ with ${|F|=q}$ are asymptotically good if $q$ is even (odd respectively). In this paper, we…

We derive global weak solutions of Einstein's equations for spherically symmetric dust-filled space-times which admit shell-crossing singularities. In the marginally bound case, the solutions are weak solutions of a conservation law. In the…

In this paper, it is proved that, in a dual context, asymptotic expansions of ordinary linear time-differential equations which possess limiting equations to their limiting equations might be obtained by first discretizing them and then…

Let $\mathbf{X}(n) \in \mathbb{R}^d$ be a sequence of random vectors, where $n\in\mathbb{N}$ and $d = d(n)$. Under certain weakly dependence conditions, we prove that the distribution of the maximal component of $\mathbf{X}$ and the…

We consider the problem of constructing prefix-free codes in which a designated symbol, a space, can only appear at the end of codewords. We provide a linear-time algorithm to construct almost-optimal codes with this property, meaning that…

There are exactly two non-commutative rings of size $4$, namely, $E = \langle a, b ~\vert ~ 2a = 2b = 0, a^2 = a, b^2 = b, ab= a, ba = b\rangle$ and its opposite ring $F$. These rings are non-unital. A subset $D$ of $E^m$ is defined with…

We study the minimum number of distinct eigenvalues over a collection of matrices associated with a graph. Lower bounds are derived based on the existence or non-existence of certain cycle(s) in a graph. A key result proves that every…

Singular limits of a class of evolutionary systems of partial differential equations having two small parameters and hence three time scales are considered. Under appropriate conditions solutions are shown to exist and remain uniformly…