2025/02/04 by Qingfeng Xia, Hongwei Liu, Xia, Qingfeng +5
Computer Science · Engineering · Mathematics · #Advanced Topics in Algebra #Coding theory and cryptography #FOS: Computer and information sciences #Information Theory (cs.IT) #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.2502.02222
openalex publication_date 2025/02/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Sum-rank codes are an important class of codes which can be utilized for linear network coding, space-time coding and distributed storage. They can not only reduce the size of network alphabet but also detect and correct more errors. Based on the duality theory of sum-rank codes [Byrne, Gluesing-Luerssen, Ravagnani, IEEE TIT, 2021] and those related theory of rank-metric codes, it is significant to study self-dual codes and linear complementary dual (LCD) codes in sum-rank metric. In this paper, we introduce the notion of self-dual codes and LCD codes in sum-rank metric, and obtain two methods of constructing self-dual sum-rank codes and LCD sum-rank codes from Euclidean self-dual codes and Euclidean LCD codes. Some examples of cyclic self-dual sum-rank codes and cyclic LCD sum-rank codes with good parameters are provided. In addition, we prove that there exist asymptotically good self-dual sum-rank codes.