Reversible codes have a range of wide applications in cryptography, data storage, and communication systems. In this paper, we investigated reversible codes under the Rosenbloom-Tsfasman metric (RT-metric). First, some properties of reversible codes in the RT-metric were described. An essential condition for a reversible code to be a maximum distance separable code (MDS code, in short) in the RT-metric was established. A necessary condition for a binary self-dual code to be reversible was proven and the same was generalized for $q$-ary self-dual reversible codes. Several constructions for reversible RT-metric codes were provided in terms of their generator matrices.

Maximum distance separable (MDS) codes are a type of error-correcting codes that aim to optimize the shortest possible distance between codewords. These codes are useful in situations where error correction is critical, such as data storage or communication systems, and they can be found in a variety of domains, including information theory, cryptography, and reliable data transmission. The concept of MDS codes is fundamental in designing robust and efficient error-correcting codes that can withstand the challenges posed by noisy communication channels or unreliable storage systems. The Rosenbloom-Tsfasman (RT) metric provides a framework for constructing codes optimized for error correction, and reversible codes leverage this to maximize their error-correction capabilities. This study explored the characteristics of reversible MDS codes in the RT-metric by analyzing the structure of different types of generator matrices. It also established various properties of these codes, such as the conditions under which certain reversible MDS codes were self-dual over ${\mathbb{F}}_2$ and ${\mathbb{F}}_q$. In addition, this study proposed several constructions for reversible MDS codes in the RT-metric.