Bounds for the multilevel construction

11/13/2020
by   Tao Feng, et al.
0

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 𝒫_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 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/23/2019

On q-ary codes with two distances d and d+1

The q-ary block codes with two distances d and d+1 are considered. Sever...
research
12/22/2021

Construction and bounds for subspace codes

Subspace codes are the q-analog of binary block codes in the Hamming met...
research
04/29/2020

Lifted codes and the multilevel construction for constant dimension codes

Constant dimension codes are e.g. used for error correction and detectio...
research
10/16/2019

Universal Bounds for Size and Energy of Codes of Given Minimum and Maximum Distances

We employ signed measures that are positive definite up to certain degre...
research
11/23/2018

On three domination numbers in block graphs

The problems of determining minimum identifying, locating-dominating or ...
research
09/15/2021

The interplay of different metrics for the construction of constant dimension codes

A basic problem for constant dimension codes is to determine the maximum...
research
02/12/2018

On Minrank and the Lovász Theta Function

Two classical upper bounds on the Shannon capacity of graphs are the ϑ-f...

Please sign up or login with your details

Forgot password? Click here to reset