Self-orthogonal codes constructed from posets and their applications in quantum communication

Yansheng Wu, Yoonjin Lee

Research output: Contribution to journalArticlepeer-review

Abstract

It is an important issue to search for self-orthogonal codes for construction of quantum codes by CSS construction (Calderbank-Sho-Steane codes); in quantum error correction, CSS codes are a special type of stabilizer codes constructed from classical codes with some special properties, and the CSS construction of quantum codes is a well-known construction. First, we employ hierarchical posets with two levels for construction of binary linear codes. Second, we find some necessary and sufficient conditions for these linear codes constructed using posets to be self-orthogonal, and we use these self-orthogonal codes for obtaining binary quantum codes. Finally, we obtain four infinite families of binary quantum codes for which the minimum distances are three or four by CSS construction, which include binary quantum Hamming codes with length n ≥ 7. We also find some (almost) "optimal" quantum codes according to the current database of Grassl. Furthermore, we explicitly determine the weight distributions of these linear codes constructed using posets, and we present two infinite families of some optimal binary linear codes with respect to the Griesmer bound and a class of binary Hamming codes.

Original languageEnglish
Article number1495
JournalMathematics
Volume8
Issue number9
DOIs
StatePublished - Sep 2020

Keywords

  • Binary linear code
  • Poset
  • Quantum code
  • Self-orthogonal code
  • Weight distribution

Fingerprint

Dive into the research topics of 'Self-orthogonal codes constructed from posets and their applications in quantum communication'. Together they form a unique fingerprint.

Cite this