Linear programming bounds for codes in infinite projective spaces (Q1818899): Difference between revisions

Let \(F\mathbb{P}^{n-1}\) denote the projective space of lines through the origin in \(F^n\), where \(F\) is either the field of real numbers, or the field of complex numbers, or the algebra of quaternions. In the paper under review, a technique for improving the universal programming bounds on the cardinality and the minimum distance of codes in projective spaces \(F\mathbb{P}^{n-1}\) is developed. Also, some possibilities for attaining the first universal bounds are investigated.