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

Abstract

Let SLAut(Fqn) denote the group of all semilinear isometries on Fqn, where q=pe 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 dimFq(Hullσ(C))=dimFq(Hullσ(Cσ)). We prove that for any integer h with max\0,k1-k2\≤ h≤ dimFq(C12σ), there exists a linear code C2,h monomially equivalent to C2 such that dimFq(C12,hσ)=h, where Ci is an [n,ki]q linear code for i=1,2. We show that given an [n,k,d]q linear code C, there exists a monomially equivalent [n,k,d]q linear code Ch, 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≤ h≤ dimFq(Hullσ(C)). Based on this result, we present a general construction method for deriving EAQECCs with flexible parameters from MP codes related to σ hulls.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…