SearcharxivSearch

arXiv subjects

Ling San

Publications and source records attributed to Ling San.

2 recordsLinked to original sources

Hermitian Hulls of Rational Algebraic Geometry Codes and Applications in Quantum Codes

Interest in the hulls of linear codes has been growing rapidly. More is known when the inner product is Euclidean than Hermitian. A shift to the latter is gaining traction. The focus is on a code whose Hermitian hull dimension and dual distance can be systematically determined. Such a code can serve as an ingredient in designing the parameters of entanglement-assisted quantum error-correcting codes (EAQECCs). We use tools from algebraic function fields of one variable to efficiently determine a good lower bound on the Hermitian hull dimensions of generalized rational algebraic geometry (AG) codes. We identify families of AG codes whose hull dimensions can be well estimated by a lower bound. Given such a code, the idea is to select a set of evaluation points for which the residues of the Weil differential associated with the Hermitian dual code has an easily verifiable property. The approach allows us to construct codes with designed Hermitian hull dimensions based on known results on Reed-Solomon codes and their generalization. Using the Hermitian method on these maximum distance separable (MDS) codes with designed hull dimensions yields two families of MDS EAQECCs. We confirm that the excellent parameters of the quantum codes from these families are new.

cs.IT

New bounds for $b$-Symbol Distances of Matrix Product Codes

Matrix product codes are generalizations of some well-known constructions of codes, such as Reed-Muller codes, $[u+v,u-v]$-construction, etc. Recently, a bound for the symbol-pair distance of a matrix product code was given in \cite{LEL}, and new families of MDS symbol-pair codes were constructed by using this bound. In this paper, we generalize this bound to the $b$-symbol distance of a matrix product code and determine all minimum $b$-symbol distances of Reed-Muller codes. We also give a bound for the minimum $b$-symbol distance of codes obtained from the $[u+v,u-v]$-construction, and use this bound to construct some $[2n,2n-2]_q$-linear $b$-symbol almost MDS codes with arbitrary length. All the minimum $b$-symbol distances of $[n,n-1]_q$-linear codes and $[n,n-2]_q$-linear codes for $1\leq b\leq n$ are determined. Some examples are presented to illustrate these results.

cs.IT