Show simple item record

dc.contributor.authorPullan, W
dc.contributor.authorWu, XW
dc.contributor.authorLiu, Z
dc.date.accessioned2019-03-14T23:37:13Z
dc.date.available2019-03-14T23:37:13Z
dc.date.issued2016
dc.identifier.issn1382-6905
dc.identifier.doi10.1007/s10878-015-9864-z
dc.identifier.urihttp://hdl.handle.net/10072/126317
dc.description.abstractA subspace code of length n over the finite field Fq is a collection of subspaces of the n -dimensional vector space Fnq . 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.
dc.description.peerreviewedYes
dc.languageEnglish
dc.publisherSpringer
dc.publisher.placeUnited States
dc.relation.ispartofpagefrom1
dc.relation.ispartofpageto11
dc.relation.ispartofjournalJournal of Combinatorial Optimization
dc.subject.fieldofresearchArtificial Intelligence and Image Processing not elsewhere classified
dc.subject.fieldofresearchPure Mathematics
dc.subject.fieldofresearchApplied Mathematics
dc.subject.fieldofresearchNumerical and Computational Mathematics
dc.subject.fieldofresearchcode080199
dc.subject.fieldofresearchcode0101
dc.subject.fieldofresearchcode0102
dc.subject.fieldofresearchcode0103
dc.subject.keywordsSubspace codes
dc.subject.keywordsOptimisation
dc.subject.keywordsMaximum independent set
dc.subject.keywordsBig graphs
dc.titleConstruction of optimal constant-dimension subspace codes
dc.typeJournal article
dc.type.descriptionC1 - Articles
dc.type.codeC - Journal Articles
gro.facultyGriffith Sciences, School of Information and Communication Technology
gro.hasfulltextNo Full Text
gro.griffith.authorPullan, Wayne J.
gro.griffith.authorWu, Xin-Wen


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

  • Journal articles
    Contains articles published by Griffith authors in scholarly journals.

Show simple item record