Search arXiv⌕ Search

arXiv subjects

Shitao Li

Publications and source records attributed to Shitao Li.

22 records · Page 2Linked to original sources

Several classes of Galois self-orthogonal MDS codes and related applications

Let $q=p^h$ be a prime power and $e$ be an integer with $0\leq e\leq h-1$. $e$-Galois self-orthogonal codes are generalizations of Euclidean self-orthogonal codes ($e=0$) and Hermitian self-orthogonal codes ($e=\frac{h}{2}$ and $h$ is even). In this paper, we propose two general methods to construct $e$-Galois self-orthogonal (extended) generalized Reed-Solomon (GRS) codes. As a consequence, eight new classes of $e$-Galois self-orthogonal (extended) GRS codes with odd $q$ and $2e\mid h$ are obtained. Based on the Galois dual of a code, we also study its punctured and shortened codes. As applications, new $e'$-Galois self-orthogonal maximum distance separable (MDS) codes for all possible $e'$ satisfying $0\leq e'\leq h-1$, new $e$-Galois self-orthogonal MDS codes via the shortened codes, and new MDS codes with prescribed dimensional $e$-Galois hull via the punctured codes are derived. Moreover, some new $\sqrt{q}$-ary quantum MDS codes with lengths greater than $\sqrt{q}+1$ and minimum distances greater than $\frac{\sqrt{q}}{2}+1$ are obtained.

cs.IT↗

Optimal quaternary linear codes with one-dimensional Hermitian hull and the related EAQECCs

Linear codes with small hulls over finite fields have been extensively studied due to their practical applications in computational complexity and information protection. In this paper, we develop a general method to determine the exact value of $D_4^H(n,k,1)$ for $n\leq 12$ or $k\in \{1,2,3,n-1,n-2,n-3\}$, where $D_4^H(n,k,1)$ denotes the largest minimum distance among all quaternary linear $[n,k]$ codes with one-dimensional Hermitian hull. As a consequence, we solve a conjecture proposed by Mankean and Jitman on the largest minimum distance of a quaternary linear code with one-dimensional Hermitian hull. As an application, we construct some binary entanglement-assisted quantum error-correcting codes (EAQECCs) from quaternary linear codes with one-dimensional Hermitian hull. Some of these EAQECCs are optimal codes, and some of them are better than previously known ones.

cs.IT↗

Two conjectures on the largest minimum distances of binary self-orthogonal codes with dimension 5

The purpose of this paper is to solve the two conjectures on the largest minimum distance $d_{so}(n,5)$ of a binary self-orthogonal $[n,5]$ code proposed by Kim and Choi (IEEE Trans. Inf. Theory, 2022). The determination of $d_{so}(n,k)$ has been a fundamental and difficult problem in coding theory because there are too many binary self-orthogonal codes as the dimension $k$ increases. Recently, Kim et al. (2021) considered the shortest self-orthogonal embedding of a binary linear code, and many binary optimal self-orthogonal $[n,k]$ codes were constructed for $k=4,5$. Kim and Choi (2022) improved some results of Kim et al. (2021) and made two conjectures on $d_{so}(n,5)$. In this paper, we develop a general method to determine the exact value of $d_{so}(n,k)$ for $k=5,6$ and show that the two conjectures made by Kim and Choi (2022) are true.

cs.IT↗

An improved method for constructing linear codes with small hulls

In this paper, we give a method for constructing linear codes with small hulls by generalizing the method in \cite{LCD-T-matric}. As a result, we obtain many optimal Euclidean LCD codes and Hermitian LCD codes, which improve the previously known lower bound on the largest minimum distance. We also obtain many optimal codes with one-dimension hull. Furthermore, we give three tables about formally self-dual LCD codes.

cs.IT↗