Completely decomposable rank-metric codes
Information Theory
2024-06-28 v1 math.IT
Abstract
In this paper, we investigate completely decomposable rank-metric codes, i.e. rank-metric codes that are the direct sum of 1-dimensional maximum rank distance codes. We study the weight distribution of such codes, characterizing codewords with certain rank weights. Additionally, we obtain classification results for codes with the largest number of minimum weight codewords within the class of completely decomposable codes.
Cite
@article{arxiv.2406.19026,
title = {Completely decomposable rank-metric codes},
author = {Paolo Santonastaso},
journal= {arXiv preprint arXiv:2406.19026},
year = {2024}
}