SearcharxivSearch

arXiv subjects

Jingjie Lv

Publications and source records attributed to Jingjie Lv.

6 recordsLinked to original sources

Additive Conjucyclic Codes over $\F_{q^2}$: Trace Correspondence and Applications to Quantum Codes

Additive conjucyclic codes over $\F_{q^2}$ are closed under the conjugated cyclic shift and play an important role in constructing quantum error-correcting codes (QECCs). However, a systematic algebraic theory for such codes over general finite fields has been lacking. In this paper, we develop a unified framework by establishing a trace-based $\F_q$-linear isomorphism between $\F_{q^2}^n$ and $\F_q^{2n}$. This correspondence shows that additive conjucyclic codes of length $n$ correspond bijectively to $q$-ary linear cyclic codes of length $2n$, translating their structural analysis to the well-understood setting of cyclic codes. Using this isomorphism, we determine the enumeration of such codes and give explicit forms of their generator matrices. We then introduce an alternating inner product on $\F_{q^2}^n$, which is shown to be compatible with the symplectic inner product on $\F_q^{2n}$ under the trace isomorphism. Based on this inner product, we characterize the dual-containing condition for additive conjucyclic codes and derive explicit parity-check matrices. Finally, we construct $q$-ary QECCs from dual-containing additive conjucyclic codes. Our results unify and generalize previous studies on quaternary additive conjucyclic codes and present a construction method for $q$-ary QECCs from additive conjucyclic codes, together with an illustrative example.

cs.IT

Constructions of block MDS LDPC codes from punctured circulant matrices

Low density parity check (LDPC) codes, initially discovered by Gallager, exhibit excellent performance in iterative decoding, approaching the Shannon limit. MDS array codes, with favorable algebraic structures, are codes suitable for decoding large burst errors. The Blaum-Roth (BR) code, an MDS array code similar to the Reed-Solomon (RS) code but has a parity-check matrix prone to $4$-cycles. Fossorier proposed constructing quasi-cyclic LDPC codes from circulant permutation matrices but are not MDS array codes. This paper aims to construct codes that possess both the block MDS property and have no $4$-cycles in the Tanner graph of their parity-check matrices, namely the so-called block MDS LDPC codes. Non-binary block MDS QC codes were first constructed by [Tauz {\it et al. }IEEE ITW, 2025] using circulant shift matrices. We first generate a family of block MDS codes over $\F_2$ from punctured circulant permutation matrices. Second, we construct a family of block MDS LDPC codes from circulant matrices with column weight $> 1$ (CM$(t)$). Additionally, we present the Moore determinant formula for CM$(t)$s and a sufficient condition to avoid $4$-cycles in CM\((t)\)-QC LDPC codes' Tanner graphs for $t> 1$. We also point out the non-existence of binary block MDS CPM-QC LDPC codes. Compared to the codes constructed in [Li {\it et al. }IEEE TIT, 2023] and [Xiao {\it et al. }IEEE TCOM, 2021], our block MDS LDPC codes show enhanced random-error-correction at a similar code length and rate. Meanwhile, these codes can effectively combat burst errors when considered as array codes. Both of our two types of constructions for block MDS LDPC codes are applicable to the scenario of the binary field.

cs.IT

Symplectic self-orthogonal quasi-cyclic codes

In this paper, we establish the necessary and sufficient conditions for quasi-cyclic (QC) codes with index even to be symplectic self-orthogonal. Subsequently, we present the lower and upper bounds on the minimum symplectic distances of a class of $1$-generator QC codes and their symplectic dual codes by decomposing code spaces. As an application, we construct numerous new binary symplectic self-orthogonal QC codes with excellent parameters, leading to $117$ record-breaking quantum error-correction codes.

cs.IT

Combinatorial Constructions of Optimal Quaternary Additive Codes

This paper aims to construct optimal quaternary additive codes with non-integer dimensions. Firstly, we propose combinatorial constructions of quaternary additive constant-weight codes, alongside additive generalized anticode construction. Subsequently, we propose generalized Construction X, which facilitates the construction of non-integer dimensional optimal additive codes from linear codes. Then, we construct ten classes of optimal quaternary non-integer dimensional additive codes through these two methods. As an application, we also determine the optimal additive $[n,3.5,n-t]_4$ codes for all $t$ with variable $n$, except for $t=6,7,12$.

cs.IT

Extended quasi-cyclic constructions of quantum codes and entanglement-assisted quantum codes

Construction of quantum codes and entanglement-assisted quantum codes with good parameters via classical codes is an important task for quantum computing and quantum information. In this paper, by a family of one-generator quasi-cyclic codes, we provide quasi-cyclic extended constructions that preserve the self-orthogonality to obtain stabilizer quantum codes. As for the computational results, some binary and ternary stabilizer codes with good parameters are constructed. Moreover, we present methods to construct maximal-entanglement entanglement-assisted quantum codes by means of the class of quasi-cyclic codes and their extended codes. As an application, some good maximal-entanglement entanglement-assisted quantum codes are obtained and their parameters are compared.

cs.IT

Constructions of quasi-twisted quantum codes

In this work, our main objective is to construct quantum codes from quasi-twisted (QT) codes. At first, a necessary and sufficient condition for Hermitian self-orthogonality of QT codes is introduced by virtue of the Chinese Remainder Theorem (CRT). Then we utilize these self-orthogonal QT codes to provide quantum codes via the famous Hermitian Construction. Moreover, we present a new construction method of q-ary quantum codes, which can be viewed as an effective generalization of the Hermitian Construction. General QT codes that are not self-orthogonal are also employed to construct quantum codes. As the computational results, some binary, ternary and quaternary quantum codes are constructed and their parameters are determined, which all exceed the Quantum Gilbert-Varshamov (GV) Bound. In the binary case, a small number of quantum codes are derived with strictly improved parameters compared with the current records. In the ternary and quaternary cases, our codes fill some gaps or have better performances than the current results.

cs.IT