Table of Contents
Fetching ...

The $σ$ hulls of matrix-product codes and related entanglement-assisted quantum error-correcting codes

Meng Cao

TL;DR

This work addresses constructing entanglement-assisted quantum error-correcting codes (EAQECCs) from matrix-product (MP) codes under a generalized $\\sigma$-inner product. It derives an explicit formula for the dimension of the $\\sigma$-hull of MP codes, establishes dual-containing and self-orthogonality conditions, and proves a symmetry of hull dimensions between a code and its $\\sigma$-dual. The authors then show how to realize any admissible hull dimension $h$ via monomial transforms, enabling EAQECCs with tunable parameters $[[n,k-h,d;n-k-h]]_{q}$ and $[[n,n-k-h,d';k-h]]_{q}$ for all $0\\le h\\le \\dim_{\\mathbb{F}_{q}}(\\mathrm{Hull}_{\\sigma}(C))$, and provide a general constructive framework that yields flexible EAQECCs from MP codes, including MDS cases. Overall, the paper broadens systematic EAQECC construction by leveraging $\\sigma$-hulls and monomial equivalence, extending prior results to wider semilinear isometries and defining matrices.

Abstract

Let $\mathrm{SLAut}(\mathbb{F}_{q}^{n})$ denote the group of all semilinear isometries on $\mathbb{F}_{q}^{n}$, where $q=p^{e}$ is a prime power. Matrix-product (MP) codes are a class of long classical codes generated by combining several commensurate classical codes with a defining matrix. We give an explicit formula for calculating the dimension of the $σ$ hull of a MP code. As a result, we give necessary and sufficient conditions for the MP codes to be $σ$ dual-containing and $σ$ self-orthogonal. We prove that $\mathrm{dim}_{\mathbb{F}_{q}}(\mathrm{Hull}_σ(\mathcal{C}))=\mathrm{dim}_{\mathbb{F}_{q}}(\mathrm{Hull}_σ(\mathcal{C}^{\bot_σ}))$. We prove that for any integer $h$ with $\mathrm{max}\{0,k_{1}-k_{2}\}\leq h\leq \mathrm{dim}_{\mathbb{F}_{q}}(\mathcal{C}_{1}\cap\mathcal{C}_{2}^{\bot_σ})$, there exists a linear code $\mathcal{C}_{2,h}$ monomially equivalent to $\mathcal{C}_{2}$ such that $\mathrm{dim}_{\mathbb{F}_{q}}(\mathcal{C}_{1}\cap\mathcal{C}_{2,h}^{\bot_σ})=h$, where $\mathcal{C}_{i}$ is an $[n,k_{i}]_{q}$ linear code for $i=1,2$. We show that given an $[n,k,d]_{q}$ linear code $\mathcal{C}$, there exists a monomially equivalent $[n,k,d]_{q}$ linear code $\mathcal{C}_{h}$, whose $σ$ dual code has minimum distance $d'$, such that there exist an $[[n,k-h,d;n-k-h]]_{q}$ EAQECC and an $[[n,n-k-h,d';k-h]]_{q}$ EAQECC for every integer $h$ with $0\leq h\leq \mathrm{dim}_{\mathbb{F}_{q}}(\mathrm{Hull}_σ(\mathcal{C}))$. Based on this result, we present a general construction method for deriving EAQECCs with flexible parameters from MP codes related to $σ$ hulls.

The $σ$ hulls of matrix-product codes and related entanglement-assisted quantum error-correcting codes

TL;DR

This work addresses constructing entanglement-assisted quantum error-correcting codes (EAQECCs) from matrix-product (MP) codes under a generalized -inner product. It derives an explicit formula for the dimension of the -hull of MP codes, establishes dual-containing and self-orthogonality conditions, and proves a symmetry of hull dimensions between a code and its -dual. The authors then show how to realize any admissible hull dimension via monomial transforms, enabling EAQECCs with tunable parameters and for all , and provide a general constructive framework that yields flexible EAQECCs from MP codes, including MDS cases. Overall, the paper broadens systematic EAQECC construction by leveraging -hulls and monomial equivalence, extending prior results to wider semilinear isometries and defining matrices.

Abstract

Let denote the group of all semilinear isometries on , where is a prime power. Matrix-product (MP) codes are a class of long classical codes generated by combining several commensurate classical codes with a defining matrix. We give an explicit formula for calculating the dimension of the hull of a MP code. As a result, we give necessary and sufficient conditions for the MP codes to be dual-containing and self-orthogonal. We prove that . We prove that for any integer with , there exists a linear code monomially equivalent to such that , where is an linear code for . We show that given an linear code , there exists a monomially equivalent linear code , whose dual code has minimum distance , such that there exist an EAQECC and an EAQECC for every integer with . Based on this result, we present a general construction method for deriving EAQECCs with flexible parameters from MP codes related to hulls.
Paper Structure (4 sections, 14 theorems, 29 equations)

This paper contains 4 sections, 14 theorems, 29 equations.

Key Result

Lemma 2.4

( Cao2024Onthe) Let $\mathcal{C}$ be an $[n,k]_{q}$ linear code with parity check matrix $H$. Set $\sigma=(\tau,\pi_{s})\in\mathrm{SLAut}(\mathbb{F}_{q}^{n})$, where $\tau$ corresponds to a monomial matrix $M_{\tau}=DP_{\tau}\in\mathbb{F}_{q}^{n\times n}$ and $1\leq s\leq e$. Then $\pi_{s}(H)(M_{\

Theorems & Definitions (25)

  • Remark 2.1
  • Definition 2.2
  • Remark 2.3
  • Lemma 2.4
  • Lemma 2.5
  • Lemma 2.6
  • Theorem 3.1
  • proof
  • Theorem 3.2
  • proof
  • ...and 15 more