Mathematical Sciences Department Virtual Discrete Math Seminar - Antonina P. Khramova, Eindhoven University of Technology

Virtual Discrete Math Seminar

Antonina P. Khramova, Eindhoven University of Technology

Zoom meeting has ended.

Title: Algebraic bounds for sum-rank-metric codes

Abstract: The sum-rank metric is a generalization of the well-known Hamming and rank metrics. In this talk, we introduce two new bounds on the maximal cardinality of the sum-rank-metric code with a given minimum distance. One of the bounds exploits a connection between such a code and a (d-1)-independent set in a graph defined for the sum-rank-metric space. We then use the eigenvalues of the graph to deduce the bound. The second bound is derived from the Delsarte's LP method, which has been previously obtained for Hamming metric, rank metric, Lee metric, and others, but the sum-rank-metric case remained open. To derive the new LP bound, we propose a way to construct an association scheme for the sum-rank metric, since the approach used in the Hamming and the rank-metric cases fails due to the associated graph not being distance-regular in general. Based on computational experiments on relatively small instances, we observe that the obtained bounds often outperform the bounds previously known for sum-rank-metric codes. This talk is based on a joint work with A. Abiad, A.L. Gavrilyuk, A. Ravagnani, and I. Ponomarenko.