SearcharxivSearch

arXiv subjects

Xiaoshan Kai

Publications and source records attributed to Xiaoshan Kai.

11 recordsLinked to original sources

New quantum codes from constacyclic codes over finite chain rings

Let $R$ be the finite chain ring $\mathbb{F}_{p^{2m}}+{u}\mathbb{F}_{p^{2m}}$, where $\mathbb{F}_{p^{2m}}$ is the finite field with $p^{2m}$ elements, $p$ is a prime, $m$ is a non-negative integer and ${u}^{2}=0.$ In this paper, we firstly define a class of Gray maps, which changes the Hermitian self-orthogonal property of linear codes over $\mathbb{F}_{2^{2m}}+{u}\mathbb{F}_{2^{2m}}$ into the Hermitian self-orthogonal property of linear codes over $\mathbb{F}_{2^{2m}}$. Applying the Hermitian construction, a new class of $2^{m}$-ary quantum codes are obtained from Hermitian constacyclic self-orthogonal codes over $\mathbb{F}_{2^{2m}}+{u}\mathbb{F}_{2^{2m}}.$ We secondly define another class of maps, which changes the Hermitian self-orthogonal property of linear codes over $R$ into the trace self-orthogonal property of linear codes over $\mathbb{F}_{p^{2m}}$. Using the Symplectic construction, a new class of $p^{m}$-ary quantum codes are obtained from Hermitian constacyclic self-orthogonal codes over $R.$

cs.IT

On Galois self-orthogonal algebraic geometry codes

Galois self-orthogonal (SO) codes are generalizations of Euclidean and Hermitian SO codes. Algebraic geometry (AG) codes are the first known class of linear codes exceeding the Gilbert-Varshamov bound. Both of them have attracted much attention for their rich algebraic structures and wide applications in these years. In this paper, we consider them together and study Galois SO AG codes. A criterion for an AG code being Galois SO is presented. Based on this criterion, we construct several new classes of maximum distance separable (MDS) Galois SO AG codes from projective lines and several new classes of Galois SO AG codes from projective elliptic curves, hyper-elliptic curves and hermitian curves. In addition, we give an embedding method that allows us to obtain more MDS Galois SO codes from known MDS Galois SO AG codes.

cs.IT

A Class of Narrow-Sense BCH Codes

BCH codes are an important class of cyclic codes which have applications in satellite communications, DVDs, disk drives, and two-dimensional bar codes. Although BCH codes have been widely studied, their parameters are known for only a few special classes. Recently, Ding et al. made some new progress in BCH codes. However, we still have very limited knowledge on the dimension of BCH codes, not to mention the weight distribution of BCH codes. In this paper, we generalize the results on BCH codes from several previous papers. The dimension of narrow-sense BCH codes of length $\frac{q^m-1}λ$ with designed distance $2\leq δ\leq \frac{q^{\lceil(m+1)/2 \rceil}-1}λ+1$ is settled, where $λ$ is any factor of $q-1$. The weight distributions of two classes of narrow-sense BCH codes of length $\frac{q^m-1}2$ with designed distance $δ=\frac{(q-1)q^{m-1}-q^{\lfloor(m-1)/2\rfloor}-1}2$ and $δ=\frac{(q-1)q^{m-1}-q^{\lfloor(m+1)/2\rfloor}-1}2$ are determined. The weight distribution of a class of BCH codes of length $\frac{q^m-1}{q-1}$ is determined. In particular, a subclass of this class of BCH codes is optimal with respect to the Griesmer bound. Some optimal linear codes obtained from this class of BCH codes are characterized.

cs.IT

A family of constacyclic codes over $\mathbb{F}_{2^{m}}+u\mathbb{F}_{2^{m}}$ and its application to quantum codes

We introduce a Gray map from $\mathbb{F}_{2^{m}}+u\mathbb{F}_{2^{m}}$ to $\mathbb{F}_{2}^{2m}$ and study $(1+u)$-constacyclic codes over $\mathbb{F}_{2^{m}}+u\mathbb{F}_{2^{m}},$ where $u^{2}=0.$ It is proved that the image of a $(1+u)$-constacyclic code length $n$ over $\mathbb{F}_{2^{m}}+u\mathbb{F}_{2^{m}}$ under the Gray map is a distance-invariant quasi-cyclic code of index $m$ and length $2mn$ over $\mathbb{F}_{2}.$ We also prove that every code of length $2mn$ which is the Gray image of cyclic codes over $\mathbb{F}_{2^{m}}+u\mathbb{F}_{2^{m}}$ of length $n$ is permutation equivalent to a binary quasi-cyclic code of index $m.$ Furthermore, a family of quantum error-correcting codes obtained from the Calderbank-Shor-Steane (CSS) construction applied to $(1+u)$-constacyclic codes over $\mathbb{F}_{2^{m}}+u\mathbb{F}_{2^{m}}.$

cs.IT

Some new bounds on LCD codes over finite fields

In this paper, we show that LCD codes are not equivalent to linear codes over small finite fields. The enumeration of binary optimal LCD codes is obtained. We also get the exact value of LD$(n,2)$ over $\mathbb{F}_3$ and $\mathbb{F}_4$. We study the bound of LCD codes over $\mathbb{F}_q$.

cs.IT

Entanglement-assisted quantum MDS codes constructed from constacyclic codes

Recently, entanglement-assisted quantum error correcting codes (EAQECCs) have been constructed by cyclic codes and negacyclic codes. In this paper, by analyzing the cyclotomic cosets in the defining set of constacyclic codes, we constructed three classes of new EAQECCs which satisfy the entanglement-assisted quantum Singleton bound. Besides, three classes of EAQECCs with maximal entanglement from constacyclic codes are constructed in the meanwhile.

cs.IT

One-Lee weight and two-Lee weight $\mathbb{Z}_2\mathbb{Z}_2[u]$-additive codes

In this paper, we study one-Lee weight and two-Lee weight codes over $\mathbb{Z}_{2}\mathbb{Z}_{2}[u]$, where $u^{2}=0$. Some properties of one-Lee weight $\mathbb{Z}_{2}\mathbb{Z}_{2}[u]$-additive codes are given, and a complete classification of one-Lee weight $\mathbb{Z}_2\mathbb{Z}_2[u]$-additive formally self-dual codes is obtained. The structure of two-Lee weight projective $\mathbb{Z}_2\mathbb{Z}_2[u]$ codes is determined. Some optimal binary linear codes are obtained directly from one-Lee weight and two-Lee weight $\mathbb{Z}_{2}\mathbb{Z}_{2}[u]$-additive codes via the extended Gray map.

math.RA

On $\mathbb{Z}_{2}\mathbb{Z}_{2}[u]$-$(1+u)$-additive constacyclic

In this paper, we study $\mathbb{Z}_{2}\mathbb{Z}_{2}[u]$-$(1+u)$-additive constacyclic code of arbitrary length. Firstly, we study the algebraic structure of this family of codes and a set of generator polynomials for this family as a $(\mathbb{Z}_{2}+u\mathbb{Z}_{2})[x]$-submodule of the ring $R_{α,β}$. Secondly, we give the minimal generating sets of this family codes, and we determine the relationship of generators between the $\mathbb{Z}_{2}\mathbb{Z}_{2}[u]$-$(1+u)$-additive constacyclic codes and its dual and give the parameters in terms of the degrees of the generator polynomials of the code. Lastly, we also study $\mathbb{Z}_{2}\mathbb{Z}_{2}[u]$-$(1+u)$-additive constacyclic code in terms of the Gray images.

cs.IT

New quantum codes from dual-containing cyclic codes over finite rings

Let $R=\mathbb{F}_{2^{m}}+u\mathbb{F}_{2^{m}}+\cdots+u^{k}\mathbb{F}_{2^{m}}$ , where $\mathbb{F}_{2^{m}}$ is a finite field with $2^{m}$ elements, $m$ is a positive integer, $u$ is an indeterminate with $u^{k+1}=0.$ In this paper, we propose the constructions of two new families of quantum codes obtained from dual-containing cyclic codes of odd length over $R$. A new Gray map over $R$ is defined and a sufficient and necessary condition for the existence of dual-containing cyclic codes over $R$ is given. A new family of $2^{m}$-ary quantum codes is obtained via the Gray map and the Calderbank-Shor-Steane construction from dual-containing cyclic codes over $R.$ Furthermore, a new family of binary quantum codes is obtained via the Gray map, the trace map and the Calderbank-Shor-Steane construction from dual-containing cyclic codes over $R.$

cs.IT

MacWilliams type identities on the Lee and Euclidean weights for linear codes over $\mathbb{Z}_{\ell}$

Motivated by the works of Shiromoto [3] and Shi et al. [4], we study the existence of MacWilliams type identities with respect to Lee and Euclidean weight enumerators for linear codes over $\mathbb{Z}_{\ell}.$ Necessary and sufficient conditions for the existence of MacWilliams type identities with respect to Lee and Euclidean weight enumerators for linear codes over $\mathbb{Z}_{\ell}$ are given. Some examples about such MacWilliams type identities are also presented.

cs.IT

Repeated-root constacyclic codes of length $3lp^{s}$ and their dual codes

Let $p\neq3$ be any prime and $l\neq3$ be any odd prime with $gcd(p,l)=1$. $F_{q}^{*}=\langleξ\rangle$ is decomposed into mutually disjoint union of $gcd(q-1,3lp^{s})$ coset over the subgroup $\langleξ^{3lp^{s}}\rangle$, where $ξ$ is a primitive $(q-1)$th root of unity. We classify all repeated-root constacyclic codes of length $3lp^{s}$ over the finite field $F_{q}$ into some equivalence classes by the decomposition, where $q=p^{m}$, $s$ and $m$ are positive integers. According to the equivalence classes, we explicitly determine the generator polynomials of all repeated-root constacyclic codes of length $3lp^{s}$ over $F_{q}$ and their dual codes. Self-dual cyclic(negacyclic) codes of length $3lp^{s}$ over $F_{q}$ exist only when $p=2$. And we give all self-dual cyclic(negacyclic) codes of length $3l2^{s}$over $F_{2^{m}}$ and its enumeration.

cs.IT