Construction of optimal constant-dimension subspace codes

Wayne Pullan (), Xin-Wen Wu () and Zihui Liu ()
Additional contact information
Wayne Pullan: Griffith University
Xin-Wen Wu: Griffith University
Zihui Liu: Beijing Institute of Technology

Journal of Combinatorial Optimization, 2016, vol. 31, issue 4, No 23, 1709-1719

Abstract: 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.

Keywords: Subspace codes; Optimisation; Maximum independent set; Big graphs (search for similar items in EconPapers)
Date: 2016
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-015-9864-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:31:y:2016:i:4:d:10.1007_s10878-015-9864-z

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-015-9864-z

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().