Symplectic self-orthogonal quasi-cyclic codes

12/29/2022
by   Chaofeng Guan, et al.
0

In this paper, we obtain necessary and sufficient conditions for quasi-cyclic codes with index even to be symplectic self-orthogonal. Then, we propose a method for constructing symplectic self-orthogonal quasi-cyclic codes, which allows arbitrary polynomials that divide x^n-1 to construct symplectic self-orthogonal codes. Finally, we construct many binary symplectic self-orthogonal codes with excellent parameters, corresponding to over a hundred record-breaking quantum codes, improving Grassl's table (bounds on the minimum distance of quantum codes. http://www.codetables.de).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/02/2023

Polynomial representation of additive cyclic codes and new quantum codes

We give a polynomial representation for additive cyclic codes over 𝔽_p^2...
research
09/11/2023

On the Structure of the Linear Codes with a Given Automorphism

The purpose of this paper is to present the structure of the linear code...
research
10/10/2022

Quasi-cyclic Hermitian construction of binary quantum codes

In this paper, we propose a sufficient condition for a family of 2-gener...
research
12/19/2017

Quasi-Cyclic Constructions of Quantum Codes

We give sufficient conditions for self-orthogonality with respect to sym...
research
12/11/2019

Constructions of quasi-twisted quantum codes

In this work, our main objective is to construct quantum codes from quas...
research
08/04/2021

On origami-like quasi-mechanisms with an antiprismatic skeleton

We study snapping and shaky polyhedra which consist of antiprismatic ske...
research
10/12/2022

Two conjectures on the largest minimum distances of binary self-orthogonal codes with dimension 5

The purpose of this paper is to solve the two conjectures on the largest...

Please sign up or login with your details

Forgot password? Click here to reset