IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v31y2016i4d10.1007_s10878-015-9864-z.html
   My bibliography  Save this article

Construction of optimal constant-dimension subspace codes

Author

Listed:
  • Wayne Pullan

    (Griffith University)

  • Xin-Wen Wu

    (Griffith University)

  • Zihui Liu

    (Beijing Institute of Technology)

Abstract

A subspace code of length $$n$$ n over the finite field $$\mathbb {F}_q$$ F q is a collection of subspaces of the $$n$$ n -dimensional vector space $$\mathbb {F}_q^n$$ F q n . Subspace codes are applied to a number of areas such as noncoherent linear network coding and linear authentication. A challenge in the research of subspace codes is to construct large codes with prescribed code parameters, such that the codes have the maximum number of codewords, or the number of codewords is larger than that of previously known codes. In the literature, a general method was proposed for the construction of large constant-dimension subspace codes based on integer linear programming. In this work, making use of an optimization approach for finding the maximum independent set of a graph, a procedure is developed for constructing large subspace codes. The procedure, in some cases, outperforms the existing approach based on integer linear programming, and finds new subspace codes that have more codewords than existing codes.

Suggested Citation

  • Wayne Pullan & Xin-Wen Wu & Zihui Liu, 2016. "Construction of optimal constant-dimension subspace codes," Journal of Combinatorial Optimization, Springer, vol. 31(4), pages 1709-1719, May.
    • Handle: RePEc:spr:jcomop:v:31:y:2016:i:4:d:10.1007_s10878-015-9864-z
    DOI: 10.1007/s10878-015-9864-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-015-9864-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-015-9864-z?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Liao, Jiaqi & Cao, Mengyu & Lu, Mei, 2023. "On the P3-hull numbers of q-Kneser graphs and Grassmann graphs," Applied Mathematics and Computation, Elsevier, vol. 437(C).

    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:spr:jcomop:v:31:y:2016:i:4:d:10.1007_s10878-015-9864-z. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.