2022•CINECA IRIS Institutional Research Information System (University of Basilicata)Requires access

Subspace code constructions

Antonio Cossidente, Giuseppe Marino, Francesco Pavese

Abstract

We improve on the lower bound of the maximum number of planes of PG(8, q) mutually intersecting in at most one point leading to the following lower bound: A(q) (9, 4; 3) >= q(12) + 2q(8) + 2q(7) + q(6) + q(5) + q(4) + 1. We also construct two new nonequivalent (6, (q(3) - 1)(q(2) + q + 1), 4; 3) q-constant dimension subspace orbit-codes.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Subspace topology, Dimension (graph theory), Upper and lower bounds, Mathematics, Combinatorics, Code (set theory), Constant (computer programming), Orbit (dynamics)