Roos bound for skew cyclic codes in Hamming and rank metric Alfarano, Gianira Lobillo Borrero, Francisco Javier Neri, Alessandro Cyclic codes Skew cyclic codes Roos bound Rank-metric codes MRD codes In this paper, a Roos like bound on the minimum distance for skew cyclic codes over a general field is provided. The result holds in the Hamming metric and in the rank metric. The proofs involve arithmetic properties of skew polynomials and an analysis of the rank of parity-check matrices. For the rank metric case, a way to arithmetically construct codes with a prescribed minimum rank distance, using the skew Roos bound, is also given. Moreover, some examples of MDS codes and MRD codes over finite fields are built, using the skew Roos bound. 2025-01-15T11:43:50Z 2025-01-15T11:43:50Z 2021-01 journal article https://hdl.handle.net/10481/99242 10.1016/j.ffa.2020.101772 eng http://creativecommons.org/licenses/by/4.0/ open access Atribución 4.0 Internacional