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

Some Results on Self-Complementary Linear Codes

Author

Listed:
  • Maria Pashinska-Gadzheva

    (Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, 5000 Veliko Tarnovo, Bulgaria)

  • Iliya Bouyukliev

    (Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, 5000 Veliko Tarnovo, Bulgaria)

  • Valentin Bakoev

    (Faculty of Mathematics and Informatics, St. Cyril and St. Methodius University of Veliko Tarnovo, 5000 Veliko Tarnovo, Bulgaria)

Abstract

Binary codes have a special place in coding theory since they are one of the most commonly used in practice. There are classes of codes specific only to the binary case. One such class is self-complementary codes. Self-complementary linear codes are binary codes that, together with any vector, contain its complement as well. This paper is about binary linear self-complementary codes. A natural goal in coding theory is to find a linear code with a given length n and dimension k such that the minimum distance d is maximal. Codes with these properties are called optimal. Another important issue is classifying the optimal codes, i.e., finding exactly one representative of each equivalence class. In some sense, the classification problem is more general than the minimum distance bounds problem. In this work, we summarize the classification results for self-complementary codes with the maximum possible minimum distance and a length of up to 20. For the classification, we developed a new algorithm that is much more efficient compared to existing ones in some cases.

Suggested Citation

  • Maria Pashinska-Gadzheva & Iliya Bouyukliev & Valentin Bakoev, 2023. "Some Results on Self-Complementary Linear Codes," Mathematics, MDPI, vol. 11(24), pages 1-11, December.
    • Handle: RePEc:gam:jmathe:v:11:y:2023:i:24:p:4950-:d:1299873
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/24/4950/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/11/24/4950/
    Download Restriction: no
    ---><---

    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:11:y:2023:i:24:p:4950-:d:1299873. 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.