2022/12/29 by Chaofeng Guan, Guan, Chaofeng, Ruihu Li +3 · 1 citation
Computer Science · #Coding theory and cryptography #Educational Methods and Media Use #FOS: Computer and information sciences #Information Theory (cs.IT)
paper · pdf · doi:10.48550/arxiv.2212.14225
openalex publication_date 2022/12/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.