Eigenvalue bounds for sum-rank-metric codes

DOI10.1109/TIT.2023.3339808MaRDI QIDQ6576648zbMATH OpenFDO

Authors Aida Abiad, Antonina P. Khramova, Alberto Ravagnani

Publication date 23 July 2024

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Information and communication theory, circuits (94-XX)

Cited in

(1)

• The clique number of the exact distance \(t\)-power graph: complexity and eigenvalue bounds

This page was built for publication: Eigenvalue bounds for sum-rank-metric codes

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