Quantum codes and optimal pure quantum $(r,\hat{I}´)$-LRCs via the MP construction

Abstract

In this paper, we employ MP codes whose defining matrices are $\ddot{I}„$-optimal defining ($\ddot{I}„$-OD) matrices to construct new quantum codes and quantum $(r,\hat{I}´)$-LRCs. Specifically, we report the following results: We establish a unified $\ddot{I}„$-monomial decomposition theorem for invertible self-adjoint matrices over finite fields of arbitrary characteristic, which generalizes the result in "Quantum codes using the $\ddot{I}„$-OD MP construction" where the characteristic was required to be odd. Based on this theorem, we prove the existence of $\ddot{I}„$-OD matrices over ${\mathbb{F}}_{q^2}$ for any characteristic and demonstrate that there exist several new infinite families of $\ddot{I}„$-OD matrices over ${\mathbb{F}}_{q^2}$ of characteristic $2$. As an application of MP codes involving $\ddot{I}„$-OD matrices, we construct several infinite families of quantum codes with flexible parameters. Within this framework, we present $222$ record-breaking quantum codes that surpass the best-known records maintained in Grassl's database. We propose two effective schemes for constructing optimal pure quantum $(r,\hat{I}´)$-LRCs via MP codes. Accordingly, we construct four new infinite families of optimal pure quantum $(r,\hat{I}´)$-LRCs with flexible parameters. Notably, we report an interesting phenomenon by exhibiting $30$ optimal pure quantum $(r,\hat{I}´)$-LRCs derived from our framework; that is, there exist quantum codes that are not only optimal pure quantum $(r,\hat{I}´)$-LRCs but also, according to Grassl's database, best-known, optimal, or record-breaking quantum codes. To the best of our knowledge, the new discovery that quantum codes are simultaneously optimal pure quantum $(r,\hat{I}´)$-LRCs and record-breaking quantum codes has not been previously reported in the literature.