Back to Search
Start Over
Lower Bounds for Quasi-Cyclic Codes and New Binary Quantum Codes.
- Source :
-
Symmetry (20738994) . Mar2023, Vol. 15 Issue 3, p643. 15p. - Publication Year :
- 2023
-
Abstract
- This paper considers three kinds of quasi-cyclic codes of index two with one generator or two generators and their applications in quantum code construction. In accordance with the algebraic structure of linear codes, we determine the lower bounds of the symplectic weights of these quasi-cyclic codes. Quasi-cyclic codes with the dual-containing property enable the construction of quantum codes. Defining the coefficient symmetric polynomials of the generator polynomials gives a concise condition for the dual-containing of the quasi-cyclic codes. The lower bound results can significantly reduce the scope of the search for a larger minimum distance of quasi-cyclic codes. With these algebraic results and computer supports, we obtain classical quasi-cyclic codes with better parameters and some new quantum codes under the symplectic construction. In particular, two examples of the new quantum codes [ [ 63 , 42 , 6 ] ] 2 , [ [ 51 , 35 , 5 ] ] 2 improve the corresponding codes in Grassl's code table. [ABSTRACT FROM AUTHOR]
- Subjects :
- *CYCLIC codes
*BINARY codes
*LINEAR codes
*QUANTUM computers
*POLYNOMIALS
Subjects
Details
- Language :
- English
- ISSN :
- 20738994
- Volume :
- 15
- Issue :
- 3
- Database :
- Academic Search Index
- Journal :
- Symmetry (20738994)
- Publication Type :
- Academic Journal
- Accession number :
- 162834455
- Full Text :
- https://doi.org/10.3390/sym15030643