报告时间：2020年12月10日下午13：30-15：00

报告地点：精正楼410

报告摘要：One of the main problems in random network coding is to compute good lower and upper bounds of subspace codes, especially constant dimension codes. The determination of the exact maximum cardinality is a very tough discrete optimization problem involving a huge number of symmetries. In this talk, we consider the multilevel 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.