相关论文: Polynomial invariants of quantum codes

We study separable plus quadratic (SPQ) polynomials, i.e., polynomials that are the sum of univariate polynomials in different variables and a quadratic polynomial. Motivated by the fact that nonnegative separable and nonnegative quadratic…

We consider the geometric problem of determining the maximum number $n_q(r,h,f;s)$ of $(h-1)$-spaces in the projective space $\operatorname{PG}(r-1,q)$ such that each subspace of codimension $f$ does contain at most $s$ elements. In coding…

We study the generalized and extended weight enumerator of the q-ary Simplex code and the q-ary first order Reed-Muller code. For our calculations we use that these codes correspond to a projective system containing all the points in a…

The main theorem in this paper is a far-reaching generalization of Gleason's theorem on the weight enumerators of codes which applies to arbitrary-genus weight enumerators of self-dual codes defined over a large class of finite rings and…

Let $K$ be a field, $\Gamma $ a finite group of field automorphisms of $K$, $F$ the $\Gamma $-fixed field in $K$ and $G\leq $GL$_v(K)$ a finite matrix group. Then the action of $\Gamma $ defines a grading on the symmetric algebra of the…

Let $K$ be an arbitrary field of characteristic zero, $P_n:= K[ x_1, ..., x_n]$ be a polynomial algebra, and $P_{n, x_1}:= K[x_1^{-1}, x_1, ..., x_n]$, for $n\geq 2$. Let $\s' \in {\rm Aut}_K(P_n)$ be given by $$ x_1\mapsto x_1-1, \quad…

We determine the squarefree part of the scalar factor that arises when the quartic invariant of the generic binary form $F$ of odd degree $2n+1$ is expressed as the discriminant of the unique quadratic covariant $(F,F)_{2n}$. This…

A binary linear code is called {\em LCD} if it intersects its dual trivially. We show that the coefficients of the joint weight enumerator of such a code with its dual satisfy linear constraints, leading to a new linear programming bound on…

Let $\mathbb{F}_q$ be a finite field of characteristic not equal to $2$ or $3$. We compute the weight enumerators of some projective and affine Reed-Muller codes of order $3$ over $\mathbb{F}_q$. These weight enumerators answer enumerative…

Linear codes have been an interesting topic in both theory and practice for many years. In this paper, for an odd prime $p$, we determine the explicit complete weight enumerators of two classes of linear codes over $\mathbb{F}_p$ and they…

Colored knot polynomials possess a peculiar Z-expansion in certain combinations of differentials, which depends on the representation. The coefficients of this expansion are functions of the three variables (A,q,t) and can be considered as…

In this paper, we discuss the generalized Hamming weights of a class of linear codes associated with non-degenerate quadratic forms. In order to do so, we study the quadratic forms over subspaces of finite field and obtain some interesting…

In perturbative quantum field theory one encounters certain, very specific geometries over the integers. These perturbative quantum geometries determine the number contents of the amplitude considered. In the article `Modular forms in…

In the past few years, linear codes with few weights and their weight analysis have been widely studied. In this paper, we further investigate a class of two-weight or three-weight linear codes from defining sets and determine their weight…

In this paper, we present the harmonic generalizations of well-known polynomials of codes over finite fields, namely the higher weight enumerators and the extended weight enumerators, and we derive the correspondences between these weight…

Loop invariants are properties of a program loop that hold before and after each iteration of the loop. They are often employed to verify programs and ensure that algorithms consistently produce correct results during execution.…

In this paper we investigate the problem of constructing Topological Quantum Field Theories (TQFTs) to quantize algebraic invariants. We exhibit necessary conditions for quantizability based on Euler characteristics. In the case of…

For $(n,d)= (66,17),(78,19)$ and $(94,21)$, we construct quantum $[[n,0,d]]$ codes which improve the previously known lower bounds on the largest minimum weights among quantum codes with these parameters. These codes are constructed from…

In this paper, based on the theory of defining sets, a class of four-weight or five-weight linear codes over Fp is constructed. The complete weight enumerators of the linear codes are determined by means of Weil sums. In some case, there is…

In this note we show that the weight enumerators of a real quantum error correcting code with $ X $ and $ Z $ exactly transversal must satisfy certain identities. One consequence of these identities is that if the code is error detecting…