相关论文: A further study on the mass formula for linear cod…

Let $(G,G_1)=(G,(G^\sigma)_0)$ be a symmetric pair of holomorphic type, and we consider a pair of Hermitian symmetric spaces $D_1=G_1/K_1\subset D=G/K$, realized as bounded symmetric domains in complex vector spaces ${\mathfrak…

We analyze the four dimensional toric code in a hyperbolic space and show that it has a classical error correction procedure which runs in almost linear time and can be parallelized to almost constant time, giving an example of a quantum…

The concept of group divisible codes, a generalization of group divisible designs with constant block size, is introduced in this paper. This new class of codes is shown to be useful in recursive constructions for constant-weight and…

Two trace formulas for the spectra of arbitrary Hermitian matrices are derived by transforming the given Hermitian matrix $H$ to a unitary analogue. In the first type the unitary matrix is $e^{i(\lambda\II - H)}$ where $\lambda$ is the…

In this paper we prove new lower bounds for the maximal size of permutation codes by connecting the theory of permutation codes with the theory of linear block codes. More specifically, using the columns of a parity check matrix of an…

In this article we present a unified treatment for obtaining bounds on the potential energy of codes in the general context of polynomial metric spaces (PM-spaces). The lower bounds we derive via the linear programming (LP) techniques of…

One of the central tasks in quantum error-correction is to construct quantum codes that have good parameters. In this paper, we construct three new classes of quantum MDS codes from classical Hermitian self-orthogonal generalized…

LDPC codes play a vital role in coding theory and practical error correction. A central problem in this direction is to understand their rate--distance tradeoff. In this paper, we introduce a new framework for estimating ball sizes in the…

The $\ell$-Galois hull $h_{\ell}(C)$ of an $[n,k]$ linear code $C$ over a finite field $\mathbb{F}_q$ is the intersection of $C$ and $C^{{\bot}_{\ell}}$, where $C^{\bot_{\ell}}$ denotes the $\ell$-Galois dual of $C$ which introduced by Fan…

For the unitary ensembles of $N\times N$ Hermitian matrices associated with a weight function $w$ there is a kernel, expressible in terms of the polynomials orthogonal with respect to the weight function, which plays an important role. For…

We present a novel technique for encoding and decoding constant weight binary codes that uses a geometric interpretation of the codebook. Our technique is based on embedding the codebook in a Euclidean space of dimension equal to the weight…

Determining the weight distribution of a linear code is a classical and fundamental topic in coding theory that has been extensively investigated. Repeated-root cyclic codes, which form a significant subclass of error-correcting codes, have…

Cyclic AG-codes $C_L(D,G)$ on the Hermitian curve $H_q$ over $\mathbb{F}_{q^2}$ are constructed such that $G = m(P_2 + \ldots + P_q)$, where $2 \le m \le q-1$ and $\mathrm{supp}(G)$ is the intersection of $H_q$ with a chord $\ell$ minus two…

Clifford quantum circuits are elementary invertible transformations of quantum systems that map Pauli operators to Pauli operators. We study periodic one-parameter families of Clifford circuits, called loops of Clifford circuits, acting on…

Let $q$ be a prime power. Let $\lambda>1$ be a divisor of $q-1$, and let $\tau>1$ and $\rho>1$ be divisors of $q+1$. Under certain conditions we prove that there exists an MDS stabilizer quantum code with length $n=\lambda \tau \sigma$…

Properties of Hermitian forms are used to investigate several natural questions from CR Geometry. To each Hermitian symmetric polynomial we assign a Hermitian form. We study how the signature pairs of two Hermitian forms behave under the…

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…

Linear complementary dual (LCD) codes are linear codes that intersect with their dual trivially. We give a characterization of LCD codes over $\mathbb{F}_q$ having large minimum weights for $q \in \{2,3\}$. Using the characterization, we…

The correspondence between linear codes and representable matroids is well known. But a similar correspondence between quantum codes and matroids is not known. We show that representable symplectic matroids over a finite field…

We study covering codes of permutations with the $\ell_\infty$-metric. We provide a general code construction, which uses smaller building-block codes. We study cyclic transitive groups as building blocks, determining their exact covering…