Work

A Linear Programming Bound for Sum-Rank Metric Codes

Year: 2024

Type: article

Abstract: We derive a linear programming bound on the maximum cardinality of error-correcting codes in the sum-rank metric. Based on computational experiments on relatively small instances, we observe that the obtained bounds outperform all previously known bounds.

Source: IEEE Transactions on Information Theory

DOI: 10.1109/tit.2024.3488902

Authors: Aida Abiad, Alexander L. Gavrilyuk, Antonina P. Khramova, Ilia Ponomarenko

Institutions: Eindhoven University of Technology, Shimane University, Hainan University

Language: English

Topic: Coding theory and cryptography

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: University of Memphis, Ernest Kleinwort Charitable Trust, Japan Society for the Promotion of Science London, Universiteit Maastricht, Chinese Academy of Sciences, Technische Universiteit Eindhoven, Nederlandse Organisatie voor Wetenschappelijk Onderzoek, Saint Petersburg State University, Shimane University, Universiteit Gent, Vrije Universiteit Brussel, The Research Council, Hainan University, Universiteit van Tilburg, Japan Society for the Promotion of Science, Russian Academy of Sciences, Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, Division of Mathematical Sciences

Awards: Graphs and association schemes: higher-dimensional invariants and their applications, G2850139151, G3038808120, Algebraic Methods in Graph Recognition, Finding network structure beyond the spectrum: new frontiers and new methods, G5257353431

OpenAlex ID: W4404035835

FWCI: 0.444

Cites: 41

Cited by: 3

Related to: 10