.png){kind=icon}
Return
Optimal binary codes and binary construction of quantum codes
.png){kind=icon}
PRE
AI
DOI：10.1007/s11704-014-3469-z.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper discusses optimal binary codes and pure binary quantum codes created using Steane construction. First, a local search algorithm for a special subclass of quasi-cyclic codes is proposed, then five binary quasi-cyclic codes are built. Second, three classical construction methods are generalized for new codes from old such that they are suitable for constructing binary self-orthogonal codes, and 62 binary codes and six subcode chains of obtained self-orthogonal codes are designed. Third, six pure binary quantum codes are constructed from the code pairs obtained through Steane construction. There are 66 good binary codes that include 12 optimal linear codes, 45 known optimal linear codes, and nine known optimal self-orthogonal codes. The six pure binary quantum codes all achieve the performance of their additive counterparts constructed by quaternary construction and thus are known optimal codes.
Keywords:
binary linear code
binary self-orthogonal code
quasi-cyclic code
Steane construction
quantum code
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.6
Papers:
1.6K
Citations:
2.8K
Organization
Cited Papers
Management of opportunist mycobacterial infections: Joint Tuberculosis Committee guidelines 1999.png)
Thorax
OAAI
ThoraxIF0
OAAIShareSaveShareSaveShareSaveShareSaveShareSaveAn active suspension system for railway pantographs: the T2006 prototypeProceedings of the Institution of Mechanical Engineers, Part F: Journal of Rail and Rapid Transit
Proceedings of the Institution of Mechanical Engineers, Part F: Journal of Rail and Rapid TransitIF0
PREAI
ShareSaveShareSave no more
no more