287
Views
8
CrossRef citations to date
0
Altmetric
Original Articles

New Lower Bounds for Binary Constant-Dimension Subspace Codes

, &
Pages 179-183 | Published online: 31 Oct 2016
 

ABSTRACT

Let denote the maximum cardinality of a set of k-dimensional subspaces of an n-dimensional vector space over the finite field of order q, , such that any two different subspaces have a distance of at least d. Lower bounds on can be obtained by explicitly constructing corresponding sets . When searching for such sets with a prescribed group of automorphisms, the search problem leads to instances of the maximum weight clique problem. The main focus is here on subgroups with small index in the normalizer of a Singer subgroup of . With a stochastic maximum weight clique algorithm and a systematic consideration of groups of the above mentioned type, new lower bounds on and for 8 ⩽ n ⩽ 11 are obtained.

2000 AMS SUBJECT CLASSIFICATION:

Log in via your institution

Log in to Taylor & Francis Online

PDF download + Online access

  • 48 hours access to article PDF & online version
  • Article PDF can be downloaded
  • Article PDF can be printed
USD 61.00 Add to cart

Issue Purchase

  • 30 days online access to complete issue
  • Article PDFs can be downloaded
  • Article PDFs can be printed
USD 360.00 Add to cart

* Local tax will be added as applicable

Related Research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.