Related papers: How to Expand a Self-orthogonal Code
In this paper, we study the Hermitian hulls of generalized Reed-Solomon (GRS) codes over finite fields. For a given class of GRS codes, by extending the length, increasing the dimension, and extending the length and increasing the dimension…
Given a simplicial complex $K$, we consider several notions of geometric complexity of embeddings of $K$ in a Euclidean space ${\mathbb R}^d$: thickness, distortion, and refinement complexity (the minimal number of simplices needed for a PL…
For an arbitrary nonempty, open set $\Omega \subset \mathbb{R}^n$, $n \in \mathbb{N}$, of finite (Euclidean) volume, we consider the minimally defined higher-order Laplacian $(- \Delta)^m\big|_{C_0^{\infty}(\Omega)}$, $m \in \mathbb{N}$,…
When data is stored, compressed, or communicated through a media such as cable or air, sources of noise and other parameters such as EMI, crosstalk, and distance can considerably affect the reliability of these data. Error detection and…
In this work, we study quantum error-correcting codes obtained by using Steane-enlargement. We apply this technique to certain codes defined from Cartesian products previously considered by Galindo et al. in [4]. We give bounds on the…
The extension complexity of a polytope $P$ is the smallest integer $k$ such that $P$ is the projection of a polytope $Q$ with $k$ facets. We study the extension complexity of $n$-gons in the plane. First, we give a new proof that the…
Acceleration of algorithms is becoming a crucial problem, if larger data sets are to be processed. Evaluation of algorithms is mostly done by using computational geometry approach and evaluation of computational complexity. However in…
The family of Tremblay-Turbiner-Winternitz Hamiltonians $H_k$ on a plane, corresponding to any positive real value of $k$, is shown to admit a ${\cal N} = 2$ supersymmetric extension of the same kind as that introduced by Freedman and Mende…
We consider the recursion operators with nonlocal terms of special form for evolution systems in (1+1) dimensions, and extend them to well-defined operators on the space of nonlocal symmetries associated with the so-called universal Abelian…
In recent years, high dimensional expanders have been found to have a variety of applications in theoretical computer science, such as efficient CSPs approximations, improved sampling and list-decoding algorithms, and more. Within that, an…
Orthogonal polynomials on quadratic curves in the plane are studied. These include orthogonal polynomials on ellipses, parabolas, hyperbolas, and two lines. For an integral with respect to an appropriate weight function defined on any…
We extend the piecewise orthogonal collocation method to computing periodic solutions of coupled renewal and delay differential equations. Through a rigorous error analysis, we prove convergence of the relevant finite-element method and…
The optical resonance problem is similar to but different from time-steady Schr\"{o}dinger equation. One big challenge is that the eigenfunctions in resonance problem is exponentially growing. We give physical explanation to this boundary…
The isotropic harmonic oscillator and the Kepler-Coulomb system are pivotal models in the Sciences. They are two examples of second-order (maximally) superintegrable (Hamiltonian) systems. These systems are classified in dimension two. A…
Following Gromov, the coboundary expansion of building-like complexes is studied. In particular, it is shown that for any $n \geq 1$, there exists a constant $\epsilon(n)>0$ such that for any $0 \leq k <n$ the $k$-th coboundary expansion…
In this paper, we study Euclidean and Hermitian hulls of generalized Reed-Solomon codes and twisted generalized Reed-Solomon codes, as well as the Hermitian hulls of Roth-Lempel typed codes. We present explicit constructions of MDS and AMDS…
We establish a symmetrization procedure in a context of general orthogonal expansions associated with a second order differential operator $L$, a `Laplacian'. Combined with a unified conjugacy scheme furnished in our earlier article it…
In this paper we study Euclidean algorithms and the corresponding continued fractions for oriented linear Grassmanians $G(k,n)$. We propose two algorithms: Maximal Element Elimination algorithm and Minimal Element Elimination algorithm. The…
Cyclic and self-dual codes are important classes of codes in coding theory. Jia, Ling and Xing \cite{Jia} as well as Kai and Zhu \cite{Kai} proved that Euclidean self-dual cyclic codes of length $n$ over $\mathbb{F}_q$ exist if and only if…
We show how to develop an expansion of nearly oblate systems in terms of a set of potential-density pairs. A harmonic (multipole) structure is imposed on the potential set at infinity, and the density can be made everywhere regular. We…