Bounds for the multilevel construction

MaRDI QIDQ6353691zbMATH OpenFDO

Authors Tao Feng, Sascha Kurz, Shuangqing Liu

Publication date 13 November 2020

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of packing and covering (05B40) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Spreads and packing problems in finite geometry (51E23) Combinatorial codes (94B25)

Abstract: One of the main problems in random network coding is to compute good lower and upper bounds on the achievable cardinality of the so-called subspace codes in the projective space $mathcal{P}_q(n)$ for a given minimum distance. The determination of the exact maximum cardinality is a very tough discrete optimization problem involving a huge number of symmetries. Besides some explicit constructions for extit{good} subspace codes several of the most success full constructions involve the solution of discrete optimization subproblems itself, which mostly have not been not been solved systematically. Here we consider the multilevel a.k.a. Echelon--Ferrers construction and given lower and upper bounds for the achievable cardinalities. From a more general point of view, we solve maximum clique problems in weighted graphs, where the weights can be polynomials in the field size $q$.

This page was built for publication: Bounds for the multilevel construction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6353691)