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

On Some Families of Codes Related to the Even Linear Codes Meeting the Grey–Rankin Bound

Author

Listed:
  • Iliya Bouyukliev

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

  • Stefka Bouyuklieva

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

  • Maria Pashinska-Gadzheva

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

Abstract

Bounds for the parameters of codes are very important in coding theory. The Grey–Rankin bound refers to the cardinality of a self-complementary binary code. Codes meeting this bound are associated with families of two-weight codes and other combinatorial structures. We study the relations among six infinite families of binary linear codes with two and three nonzero weights that are closely connected to the self-complementary linear codes meeting the Grey–Rankin bound. We give a construction method and partial classification results for such codes. The properties of the codes in the studied families and their relations help us in constructing codes of a higher dimension from codes with a given dimension.

Suggested Citation

  • Iliya Bouyukliev & Stefka Bouyuklieva & Maria Pashinska-Gadzheva, 2022. "On Some Families of Codes Related to the Even Linear Codes Meeting the Grey–Rankin Bound," Mathematics, MDPI, vol. 10(23), pages 1-14, December.
    • Handle: RePEc:gam:jmathe:v:10:y:2022:i:23:p:4588-:d:992843
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/23/4588/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/10/23/4588/
    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:10:y:2022:i:23:p:4588-:d:992843. 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.