Doubly and triply extended MSRD codes
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.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.