相关论文: Discrepancy bounds for infinite-dimensional order …

For each odd prime power $q$, let $4 \leq n\leq q^{2}+1$. Hermitian self-orthogonal $[n,2,n-1]$ codes over $GF(q^{2})$ with dual distance three are constructed by using finite field theory. Hence, $[[n,n-4,3]]_{q}$ quantum MDS codes for $4…

We study the first- and second-order asymptotics of covert communication over binary-input DMC for three different covertness metrics and under maximum probability of error constraint. When covertness is measured in terms of the relative…

Constructions of quantum MDS codes have been studied by many authors. We refer to the table in page 1482 of [3] for known constructions. However there are only few $q$-ary quantum MDS $[[n,n-2d+2,d]]_q$ codes with minimum distances…

We classify all binary error correcting completely regular codes of length $n$ with minimum distance $\delta>n/2$.

We study the quantitative unique continuation property of some higher order elliptic operators. In the case of $P=(-\Delta)^m$, where $m$ is a positive integer, we derive lower bounds of decay at infinity for any nontrivial solutions under…

We study duality in $\mathcal{N}=1$ supersymmetric QCD in the non-Abelian Coulomb phase, order-by-order in scheme-independent series expansions. Using exact results, we show how the dimensions of various fundamental and composite chiral…

We construct explicitly in any finite field of the form Fq[x]/(x^m-a) elements with multiplicative order at least 2^{(2m)^(1/2)}

We consider a periodic strip in the plane and the associated quantum waveguide with Dirichlet boundary conditions. We analyse finite segments of the waveguide consisting of $L$ periodicity cells, equipped with periodic boundary conditions…

Quantum computers will need effective error-correcting codes. Current quantum processors require precise control of each particle, so having fewer particles to control might be beneficial. Although traditionally quantum computers are…

Anomalous diffusion is a phenomenon that cannot be modeled accurately by second-order diffusion equations, but is better described by fractional diffusion models. The nonlocal nature of the fractional diffusion operators makes substantially…

In this paper, a class of finite difference numerical techniques is presented to solve the second-order linear inhomogeneous damped wave equation. The consistency, stability, and convergences of these numerical schemes are discussed. The…

The construction of self-dual codes over small fields such that their minimum distances are as large as possible is a long-standing challenging problem in the coding theory. In 2009, a family of binary self-dual cyclic codes with lengths…

Let $\mathbb{F}_q$ be a finite field of order $q$ and $E$ be a set in $\mathbb{F}_q^d$. The distance set of $E$ is defined by $\Delta(E):=\{\lVert x-y \rVert :x,y\in E\}$, where $\lVert \alpha \rVert=\alpha_1^2+\dots+\alpha_d^2$. Iosevich,…

A sequence is called $C$-finite if it satisfies a linear recurrence with constant coefficients. We study sequences which satisfy a linear recurrence with $C$-finite coefficients. Recently, it was shown that such $C^2$-finite sequences…

We analyze the second moment of the ripple size during the LT decoding process and prove that the standard deviation of the ripple size for an LT-code with length $k$ is of the order of $\sqrt k.$ Together with a result by Karp et. al…

The main contribution of this work is to construct and analyze stable and high order schemes to efficiently solve the two-dimensional time Caputo-Fabrizio fractional diffusion equation. Based on a third-order finite difference method in…

This paper presents compact, symmetric, and high-order finite difference methods (FDMs) for the variable Poisson equation on a $d$-dimensional hypercube. Our scheme produces a symmetric linear system: an important property that does not…

We develop upper bounds on code size for an independent and identically distributed deletion and insertion channels for a given code length and target frame error probability. The bounds are obtained as a variation of a general converse…

Codes in finite projective spaces equipped with the subspace distance have been proposed for error control in random linear network coding. Here we collect the present knowledge on lower and upper bounds for binary subspace codes for…

In this paper we study the extreme and the periodic $L_2$ discrepancy of plane point sets. The extreme discrepancy is based on arbitrary rectangles as test sets whereas the periodic discrepancy uses "periodic intervals", which can be seen…