Related papers: How to Expand a Self-orthogonal Code
Let $q=p^m$ be a prime power, $e$ be an integer with $0\leq e\leq m-1$ and $s=\gcd(e,m)$. In this paper, for a vector $v$ and a $q$-ary linear code $C$, we give some necessary and sufficient conditions for the equivalent code $vC$ of $C$…
The aim of this paper is to construct sup-exponentially localized kernels and frames in the context of classical orthogonal expansions, namely, expansions in Jacobi polynomials, spherical harmonics, orthogonal polynomials on the ball and…
This paper proposes new propagation rules on quantum codes in the entanglement-assisted and in quantum subsystem scenarios. The rules lead to new families of such quantum codes whose parameters are demonstrably optimal. To obtain the…
Self-orthogonal codes are a significant class of linear codes in coding theory and have attracted a lot of attention. In \cite{HLL2023Te,LH2023Se}, $p$-ary self-orthogonal codes were constructed by using $p$-ary weakly regular bent…
A construction of expander codes is presented with the following three properties: (i) the codes lie close to the Singleton bound, (ii) they can be encoded in time complexity that is linear in their code length, and (iii) they have a…
The evaluation of long-range potentials in periodic, many-body systems arises as a necessary step in the numerical modeling of a multitude of interesting physical problems. Direct evaluation of these potentials requires O(N^2) operations…
We study the convergence of a discretized Fourier orthogonal expansion in orthogonal polynomials on $B^2 \times [-1,1]$, where $B^2$ is the closed unit disk in $\RR^2$. The discretized expansion uses a finite set of Radon projections and…
For a function of a type $ \left| \mathbf{r}_1{+}\ldots {+}\mathbf{r}_{_N} \right|^{-\nu} \in \mathbb{R} $ from the many-dimensional vectors $ \mathbf{r}_s $ in Euclidean space, the successive algebraic approach is the derivation of the…
The computational complexity of optimum decoding for an orthogonal space-time block code G satisfying the orthogonality property that the Hermitian transpose of G multiplied by G is equal to a constant c times the sum of the squared symbols…
We construct a family of constant-rate highly-symmetric self-dual qLDPC codes on high dimensional expanders. This is the first self-dual code constructed on high dimensional expanders and also the first such code with a rich (e.g.…
In this article, first we present a method for constructing many Hermitian LCD codes from a given Hermitian LCD code, and then provide several methods which utilize either a given [n, k, d] linear code or a given [n, k, d] Galois LCD code…
Permutation codes in the Ulam metric, which can correct multiple deletions, have been investigated extensively recently. In this work, we are interested in the maximum size of permutation codes in the Ulam metric and aim to design…
In this paper, we give a method for constructing linear codes with small hulls by generalizing the method in \cite{LCD-T-matric}. As a result, we obtain many optimal Euclidean LCD codes and Hermitian LCD codes, which improve the previously…
Extended $1$-perfect codes in the Hamming scheme $H(n,q)$ can be equivalently defined as codes that turn to $1$-perfect codes after puncturing in any coordinate, as completely regular codes with certain intersection array, as uniformly…
Equidistant codes over vector spaces are considered. For $k$-dimensional subspaces over a large vector space the largest code is always a sunflower. We present several simple constructions for such codes which might produce the largest…
We determine the central extensions of a whole family of Lie algebras, obtained by the method of graded contractions from so(N+1), N arbitrary. All the inhomogeneous orthogonal and pseudo-orthogonal algebras are members of this family, as…
We study the complexity of geometric problems on spaces of low fractal dimension. It was recently shown by [Sidiropoulos & Sridhar, SoCG 2017] that several problems admit improved solutions when the input is a pointset in Euclidean space…
The type III Hermite $X_m$ exceptional orthogonal polynomial family is generalized to a double-indexed one $X_{m_1,m_2}$ (with $m_1$ even and $m_2$ odd such that $m_2 > m_1$) and the corresponding rational extensions of the harmonic…
We develop a general technique for finding self-adjoint extensions of a symmetric operator that respect a given set of its symmetries. Problems of this type naturally arise when considering two- and three-dimensional Schr\"odinger operators…
Let L be a simple Euclidean arrangement of n pseudolines. It is shown that if L has exactly one (>=5)=gon P, and k is the number of edges of P that are adjacent to an unbounded cell of the subarrangement of L induced by the pseudolines in…