Decoding up to Hartmann–Tzeng and Roos bounds for rank codes Muñoz Fuentes, José Manuel Linear codes Rank-metric codes Decoding Hartmann–Tzeng bound Roos bound Interleaved codes Skew cyclic codes Research funded under grants PID2023-149565NB-I00 and PRE2020-093254, both financed by the Spanish Research Agency (MICIU/AEI/10.13039/501100011033), the first one being also financed by FEDER, UE and the second one being also financed by the European Social Fund “FSE invierte en tu futuro”. A class of linear block codes which simultaneously generalizes Gabidulin codes and a class of skew cyclic codes is defined. For these codes, both a Hartmann–Tzeng-like bound and a Roos-like bound, with respect to their rank distance, are described, and corresponding nearest-neighbor decoding algorithms are presented. Additional necessary conditions so that decoding can be done up to the described bounds are studied. Subfield subcodes and interleaved codes from the considered class of codes are also described, since they allow an unbounded length for the codes, providing a decoding algorithm for them; additionally, both approaches are shown to yield equivalent codes with respect to the rank metric. 2025-06-30T07:19:59Z 2025-06-30T07:19:59Z 2025-12 journal article Muñoz, J. M. Decoding up to Hartmann–Tzeng and Roos bounds for rank codes. Finite Fields Appl. (2025), 108:102676. [https://doi.org/10.1016/j.ffa.2025.102676] https://hdl.handle.net/10481/104914 10.1016/j.ffa.2025.102676 eng http://creativecommons.org/licenses/by/4.0/ open access Atribución 4.0 Internacional Elsevier