Related papers: Applications of Gaussian Binomials to Coding Theor…
A formalism for quantum error correction based on operator algebras was introduced in [1] via consideration of the Heisenberg picture for quantum dynamics. The resulting theory allows for the correction of hybrid quantum-classical…
Let l be an odd prime. For primes, p \equiv 1 (mod l), Gauss (l = 3) and Dickson (l = 5) considered the Diophantine systems in terms of which cyclotomic numbers of order 3 and 5 were obtained. The aim of this paper is to show how to obtain…
This article is about a decoding algorithm for error-correcting subspace codes. A version of this algorithm was previously described by Rosenthal, Silberstein and Trautmann. The decoding algorithm requires the code to be defined as the…
In the present article we introduce three new notions which are called Gaussian Mersenne Lucas numbers, Mersenne Lucas polynomials and Gaussian Mersenne Lucas polynomials. We present and prove our exciting properties and results of them…
This paper presents an analysis of properties of two hybrid discretization methods for Gaussian derivatives, based on convolutions with either the normalized sampled Gaussian kernel or the integrated Gaussian kernel followed by central…
We give an $n$-space generalized $q$-binomial theorem, and some new $q$ series identities that resemble the traditional $q$ series partition generating functions. These identities enumerate stepping stone weighted vector partitions.
Many statistical models are algebraic in that they are defined by polynomial constraints or by parameterizations that are polynomial or rational maps. This opens the door for tools from computational algebraic geometry. These tools can be…
One central theme in quantum error-correction is to construct quantum codes that have a large minimum distance. In this paper, we first present a construction of classical codes based on certain class of polynomials. Through these classical…
We define the cohomology and formal deformation theories for algebra and bialgebra categories. We suggest some approaches to finding nontrivial deformations of the categories associated to the quantum groups by the work of Lusztig.
This paper presents the first decoding algorithm for Gabidulin codes over Galois rings with provable quadratic complexity. The new method consists of two steps: (1) solving a syndrome-based key equation to obtain the annihilator polynomial…
We use variational methods to calculate quasilocal energy quantum corrections. A comparison with the effective potential calculated at quadratic order is made by means of gaussian wave functionals. The method is a particular case of the…
In this paper, we will obtain a variety of interesting $q$-series containing central $q$-binomial coefficients. Our approach is based on manipulating deformed basic hypergeometric series.
After a brief introduction to both quantum computation and quantum error correction, we show how to construct quantum error-correcting codes based on classical BCH codes. With these codes, decoding can exploit additional information about…
Quantum synchronisation errors are a class of quantum errors that change the number of qubits in a quantum system. The classical error correction of synchronisation errors has been well-studied, including an insertion-deletion equivalence…
The $(q,r)$-Whitney numbers were recently defined in terms of the $q$-Boson operators, and several combinatorial properties which appear to be $q$-analogues of similar properties were studied. In this paper, we obtain elementary and…
In previous work on Clebsch-Gordan coefficients, certain remarkable hexagonal arrays of integers are constructed that display behaviors found in Pascal's Triangle. We explain these behaviors further using the binomial transform and discrete…
Permutation polynomials are of particular significance in several areas of applied mathematics, such as Coding theory and Cryptography. Many recent constructions are based on the Akbary-Ghioca-Wang (AGW) criterion. Along this line of…
A simple corollary of the localization theorem (due to the author and, independently, to Lian-Liu-Yau) is applied to several problems in enumerative geometry. New formulas for Schubert calculus on flag manifolds, due to Kong, and a new…
The density deconvolution problem involves recovering a target density g from a sample that has been corrupted by noise. From the perspective of Le Cam's local asymptotic normality theory, we show that non-parametric density deconvolution…
The starting point of this work is a theorem due to Maxwell characterizing the distribution of a Gaussian vector with at least two coordinates. We define the Gaussian orthogonal, unitary and symplectic tensor ensembles for notions of real…