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 many new binary symplectic self-orthogonal QC codes with excellent parameters, leading to 117 record-breaking quantum error-correction codes.
Authors
- Chaofeng Guan (ORCID: https://orcid.org/0000-0001-5194-7999)
- Zhi Ma (ORCID: https://orcid.org/0000-0002-8946-3655)
- Ruihu Li (ORCID: https://orcid.org/0000-0003-2416-0669)
- Jingjie Lv (ORCID: https://orcid.org/0000-0002-7970-9279)
Institutions
- Dongguan University of Technology (CN)
- Air Force Engineering University (CN)
- State Key Laboratory of Cryptology (CN)
Publication Details
- Journal
- IEEE Transactions on Information Theory
- Published
- 2024-11-13
- DOI
- https://doi.org/10.1109/tit.2024.3497008
- Citations
- 1
- Primary Topic
- Coding theory and cryptography
- Type
- article
- Field-Weighted Citation Impact
- 0.35
Funders
- National Natural Science Foundation of China
- National Key Research and Development Program of China