RT info:eu-repo/semantics/article
T1 Doubly and triply extended MSRD codes
A1 Martínez Peñas, Umberto
K1 Coding theory
K1 Coding and Information Theory
K1 Linearized Reed–Solomon codes
K1 Doubly extended codes
K1 Triply extended
K1 Códigos Reed-Solomon linealizados
K1 Códigos doblemente extendidos
K1 Triplemente extendido
K1 12 Matemáticas
AB 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.
PB Elsevier
SN 1071-5797
YR 2023
FD 2023
LK https://uvadoc.uva.es/handle/10324/61245
UL https://uvadoc.uva.es/handle/10324/61245
LA eng
NO Finite Fields and Their Applications, 2023, vol. 91, 102272
NO Producción Científica
DS UVaDOC
RD 24-nov-2024