Related papers: Spectral Bounds for Quasi-Twisted Codes
We study the Scherk-Schwarz supersymmetry breaking in five-dimensional orbifold theories with five-dimensional fields which are not strictly localized on the boundaries (quasi-localized fields). We show that the Scherk-Schwarz (SS)…
We investigate isoperimetric upper bounds for sums of consecutive Steklov eigenvalues of planar domains. The normalization involves the perimeter and scale-invariant geometric factors which measure deviation of the domain from roundness. We…
We present some results dealing with the local geometry of almost complex manifolds. We establish mainly the complete hyperbolicity of strictly pseudoconvex domains, the extension of plurisubharmonic functions through generic submanifolds…
In this paper we develop algorithms for approximating matrix multiplication with respect to the spectral norm. Let A\in{\RR^{n\times m}} and B\in\RR^{n \times p} be two matrices and \eps>0. We approximate the product A^\top B using two…
We study the spectrum of tensor perturbations on extremal BTZ black holes in topologically massive gravity for arbitrary values of the coefficient of the Chern-Simons term, $\mu$. Imposing proper boundary conditions at the boundary of the…
Trigonometric polynomials are usually defined on the lattice of integers.We consider the larger class of weight and root lattices with crystallographic symmetry.This article gives a new approach to minimize trigonometric polynomials, which…
We construct new stabilizer quantum error-correcting codes from generalized monomial-Cartesian codes. Our construction uses an explicitly defined twist vector, and we present formulas for the minimum distance and dimension. Generalized…
We define a pseudo quasi-3 design as a symmetric design with the property that the derived and residual designs with respect to at least one block are quasi-symmetric. Quasi-symmetric designs can be used to construct optimal self…
The decomposition of a quasi-abelian code into shorter linear codes over larger alphabets was given in (Jitman, Ling, (2015)), extending the analogous Chinese remainder decomposition of quasi-cyclic codes (Ling, Sol\'e, (2001)). We give a…
We consider a general class of infinite dimensional reversible differential systems. Assuming a non resonance condition on the linear frequencies, we construct for such systems almost invariant pseudo norms that are closed to Sobolev-like…
A lower bound on the number of uncorrectable errors of weight half the minimum distance is derived for binary linear codes satisfying some condition. The condition is satisfied by some primitive BCH codes, extended primitive BCH codes,…
Various threshold effects are investigated on a discrete quasi-1D scattering system. In particular, one of these effects is to add corrections to Levinson's theorem. We explain how these corrections are due to the opening or to the closing…
In this paper we develop a technique to extend any bound for the minimum distance of cyclic codes constructed from its defining sets (ds-bounds) to abelian (or multivariate) codes through the notion of $\mathbb{B}$-apparent distance. We use…
We achieve new results on skew polynomial rings and their quotients, including the first explicit example of a skew polynomial ring where the ratio of the degree of a skew polynomial to the degree of its bound is not extremal. These methods…
We develop a new technique for constructing sparse graphs that allow us to prove near-linear lower bounds on the round complexity of computing distances in the CONGEST model. Specifically, we show an $\widetilde{\Omega}(n)$ lower bound for…
In this paper we study the structure of $\theta$-cyclic codes over the ring $B_k$ including its connection to quasi-$\tilde{\theta}$-cyclic codes over finite field $\mathbb{F}_{p^r}$ and skew polynomial rings over $B_k.$ We also…
We develop new, easily computable exponential decay bounds for inverses of banded matrices, based on the quasiseparable representation of Green matrices. The bounds rely on a diagonal dominance hypothesis and do not require explicit…
The Lovasz theta function provides a lower bound for the chromatic number of finite graphs based on the solution of a semidefinite program. In this paper we generalize it so that it gives a lower bound for the measurable chromatic number of…
Codes in the sum-rank metric have received many attentions in recent years, since they have wide applications in the multishot network coding, the space-time coding and the distributed storage. In this paper, by constructing covering codes…
In this work, our main objective is to construct quantum codes from quasi-twisted (QT) codes. At first, a necessary and sufficient condition for Hermitian self-orthogonality of QT codes is introduced by virtue of the Chinese Remainder…