Doubly and triply extended MSRD codes
Information Theory
2022-12-13 v1 math.IT
Abstract
In this work, doubly extended linearized Reed--Solomon codes and triply extended Reed--Solomon codes are generalized. We obtain a general result in which we characterize when a multiply extended code for a general metric attains the Singleton bound. We then use this result to obtain several families of doubly extended and triply extended maximum sum-rank distance (MSRD) codes that include doubly extended linearized Reed--Solomon codes and triply extended Reed--Solomon codes as particular cases. To conclude, we discuss when these codes are one-weight codes.
Cite
@article{arxiv.2212.05528,
title = {Doubly and triply extended MSRD codes},
author = {Umberto Martínez-Peñas},
journal= {arXiv preprint arXiv:2212.05528},
year = {2022}
}