A new upper bound for constant distance codes of generators on Hermitian polar spaces of type \(H(2d - 1, q^{2})\) (Q2255390): Difference between revisions
From MaRDI portal
Latest revision as of 16:03, 9 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A new upper bound for constant distance codes of generators on Hermitian polar spaces of type \(H(2d - 1, q^{2})\) |
scientific article |
Statements
A new upper bound for constant distance codes of generators on Hermitian polar spaces of type \(H(2d - 1, q^{2})\) (English)
0 references
9 February 2015
0 references
Let \(Y\) be a set of generators of the Hermitian polar space \(H(2d-1,q^2)\), \(d > 1\), such that any two distinct elements of \(Y\) intersect in a subspace of the same codimension \(i\). Then, \(Y\) contains at most \(q^{2d-1} - q(q^{2d-2}-1)/(q+1)\) elements. This bound does not depend on \(i\) and hence it applies in particular to partial spreads, i.e., the case \(i = d\). For \(d\) even, this bound is better than the known ones.
0 references
Hermitian polar space
0 references
association scheme
0 references
clique number
0 references
constant distance code
0 references
partial spread
0 references
0 references
0 references