Symplectic Self-Orthogonal Quasi-Cyclic Codes

IF 2.2 3区计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS

IEEE Transactions on Information Theory Pub Date : 2024-11-13 DOI:10.1109/TIT.2024.3497008

Chaofeng Guan;Ruihu Li;Jingjie Lv;Zhi Ma

引用次数: 0

Abstract

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.

查看原文本刊更多论文

辛自正交拟循环码

本文建立了具有偶数索引的拟循环码是辛自正交的充要条件。随后，通过对码空间的分解，给出了一类1-发生器QC码及其辛对偶码的最小辛距离的下界和上界。作为应用，我们构造了许多新的具有优良参数的二元辛自正交QC码，得到了117个破纪录的量子纠错码。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

IEEE Transactions on Information Theory 工程技术-工程：电子与电气

CiteScore

5.70

自引率

20.00%

发文量

514

审稿时长

12 months

期刊介绍： The IEEE Transactions on Information Theory is a journal that publishes theoretical and experimental papers concerned with the transmission, processing, and utilization of information. The boundaries of acceptable subject matter are intentionally not sharply delimited. Rather, it is hoped that as the focus of research activity changes, a flexible policy will permit this Transactions to follow suit. Current appropriate topics are best reflected by recent Tables of Contents; they are summarized in the titles of editorial areas that appear on the inside front cover.