arXiv subjects
Publications and source records attributed to Derong Xie.
In this paper, we produce two new classes of entanglement-assisted quantum MDS codes (EAQMDS codes) with length $n|q^2-1$ and $n|q^2+1$ via cyclic codes over finite fields of odd characteristic. Among our constructions there are many EAQMDS codes with new parameters which have never been reported. And some of them have great larger minimum distance than known results.
Systematic constructions of MDS self-dual codes is widely concerned. In this paper, we consider the constructions of MDS Euclidean self-dual codes from short length. Indeed, the exact constructions of MDS Euclidean self-dual codes from short length ($n=3,4,5,6$) are given. In general, we construct more new of $q$-ary MDS Euclidean self-dual codes from MDS self-dual codes of known length via generalized Reed-Solomon (GRS for short) codes and extended GRS codes.
An error model with asymmetric single magnitude four error is considered. This paper is about constructions of codes correcting single error over $\mathbb{Z}_{2^{a}3^{b}r}$. Firstly, we reduce the construction of a maximal size $B_{1}[4](2^{a}3^{b}r)$ set for $a\geq4$ and $\gcd(r,6)=1$ to the construction of a maximal size $B_{1}[4](2^{a-3}3^{b}r)$ set. Further, we will show that maximal size $B_{1}[4](8\cdot3^{b}r)$ sets can be reduced to maximal size $B_{1}[4](3^{b}r)$ sets. Finally, we give a lower bounds of maximal size $B_{1}[4](2r)$ and $B_{1}[4](2\cdot3^{b}r)$ sets.
Limited magnitude asymmetric error model is well suited for flash memory. In this paper, we consider the construction of asymmetric codes correcting single error over $\mathbb{Z}_{2^{k}r}$ and which are based on so called $B_{1}[4](2^{k}r)$ set. In fact, we reduce the construction of a maximal size $B_{1}[4](2^{k}r)$ set for $k\geq3$ to the construction of a maximal size $B_{1}[4](2^{k-3}r)$ set. Finally, we give a explicit formula of a maximal size $B_{1}[4](4r)$ set and some lower bounds of a maximal size $B_{1}[4](2r)$ set. By computer searching up to $q\leq106$, we conjecture that those lower bounds are tight.
An equi-differece conflict-avoiding code $(CAC^{e})\ \mathcal{C}$ of length $n$ and weight $ω$ is a collection of $ω$-subsets (called codewords) which has the form $\{0,i,2i,\cdots,(ω-1)i\}$ of $\mathbb{Z}_{n}$ such that $Δ(c_{1})\capΔ(c_{2})=\emptyset$ holds for any $c_{1},\ c_{2}\in\mathcal{C}$, $c_{1}\neq c_{2}$ where $Δ(c)=\{j-i \ (\mbox{mod}\ n) \; | \; i,j\in c,i\neq j\}.$ A code $\mathcal{C}\in CAC^{e}s$ with maximum code size for given $n$ and $ω$ is called optimal and is said to be perfect if $\cup_{c\in \mathcal{C}}Δ(c)=\mathbb{Z}_{n}\backslash \{0\}.$ In this paper, we show how to combine a $\mathcal{C}_{1}\in CAC^{e}(q_{1},ω)$ and a $\mathcal{C}_{2}\in CAC^{e}(q_{2},ω)$ into a $\mathcal{C}\in CAC^{e}(q_{1}q_{2},ω)$ under certain conditions. One necessary condition for a $CAC^{e}$ of length $q_{1}q_{2}$ and weight $ω$ being optimal is given. We also consider explicit construction of perfect $\mathcal{C}\in CAC^{e}(p,ω)$ of odd prime $p$ and weight $ω\geq3$. Finally, for positive integer $k$ and prime $p\equiv1 \ (\mbox{mod}\ 4k)$, we consider explicit construction of quasi-perfect $\mathcal{C}\in CAC^{e}(2p,4k+1)$.