  In this work, constructions of ordered covering arrays are discussed and
applied to obtain new upper bounds on covering codes in Rosenbloom-Tsfasman
spaces (RT spaces), improving or extending some previous results.
