Self-dual codes and LCD codes in sum-rank metric

Sum-rank codes are an important class of codes which can be utilized for linear network coding, space-time coding and distributed storage. Based on the duality theory of sum-rank codes [Byrne, Gluesing-Luerssen, Ravagnani, IEEE TIT, 2021], it is interesting to study self-dual sum-rank codes and linear complementary dual (LCD) sum-rank codes.Firstly, we characterize the dual codes of some sum-rank codes. Then we define self-dual sum-rank codes and LCD sum-rank codes, provide some basic properties of such codes and then 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 particular examples especially some cyclic self-dual sum-rank codes and cyclic LCD sum-rank codes with good parameters are also provided. At last, we prove that there exist asymptotically good self-dual sum-rank codes.