IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v8y2020i9p1495-d408504.html
   My bibliography  Save this article

Self-Orthogonal Codes Constructed from Posets and Their Applications in Quantum Communication

Author

Listed:
  • Yansheng Wu

    (School of Computer Science, Nanjing University of Posts and Telecommunications, Nanjing 210023, China
    Department of Mathematics, Ewha Womans University, Seoul 03760, Korea)

  • Yoonjin Lee

    (Department of Mathematics, Ewha Womans University, Seoul 03760, Korea)

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.

Suggested Citation

  • Yansheng Wu & Yoonjin Lee, 2020. "Self-Orthogonal Codes Constructed from Posets and Their Applications in Quantum Communication," Mathematics, MDPI, vol. 8(9), pages 1-14, September.
    • Handle: RePEc:gam:jmathe:v:8:y:2020:i:9:p:1495-:d:408504
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/8/9/1495/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/8/9/1495/
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:8:y:2020:i:9:p:1495-:d:408504. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.