We investigate the covering problem in RT spaces induced by the Rosenbloom-Tsfasman metric, extending the classical covering problem in Hamming spaces. Some connections between coverings in RT spaces and coverings in Hamming spaces are derived. Several lower and upper bounds are established for the smallest cardinality of a covering code in an RT space, generalizing results by Carnielli, Chen and Honkala, Brualdi et al., Yildiz et al. A new construction of MDS codes in RT spaces is obtained. Upper bounds are given on the basis of MDS codes, generalizing well-known results due to Stanton et al., Blokhuis and Lam, and Carnielli. Tables of lower and upper bounds are presented too.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.