Subspaces intersecting in at most a point

07/05/2019
by   Sascha Kurz, et al.
0

We improve on the lower bound of the maximum number of planes in PG(8,q)_q^9 pairwise intersecting in at most a point. In terms of constant dimension codes this leads to A_q(9,4;3)> q^12+ 2q^8+2q^7+q^6+2q^5+2q^4-2q^2-2q+1. This result is obtained via a more general construction strategy, which also yields other improvements.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/27/2019

Subspace code constructions

We improve on the lower bound of the maximum number of planes of PG(8,q...
research
10/10/2019

Construction of Const Dimension Code from Two Parallel Versions of Linkage Construction

According the report [10], the lower bound with the highest score is the...
research
05/18/2021

Improved Ackermannian lower bound for the VASS reachability problem

This draft is a follow-up of the Ackermannian lower bound for the reacha...
research
02/24/2020

A Note on Echelon-Ferrers Construction

Echelon-Ferrers is one of important techniques to help researchers to im...
research
08/25/2022

Arrangements of Pseudocircles: On Digons and Triangles

In this article, we study the cell-structure of simple arrangements of p...
research
03/15/2019

New bounds and constructions for constant weighted X-codes

As a crucial technique for integrated circuits (IC) test response compac...
research
08/21/2017

Arrangements of Pseudocircles: Triangles and Drawings

A pseudocircle is a simple closed curve on the sphere or in the plane. T...

Please sign up or login with your details

Forgot password? Click here to reset