On Rosenbloom and Tsfasman's generalization of the Hamming space (Q2455578): Difference between revisions

In 1997 [Prob. Inf. Transm. 33, No. 1, 45--52 (1997); translation from Probl. Peredachi Inf. 33, No. 1, 55--63 (1997; Zbl 1037.94545)] \textit{M. Rosenbloom} and \textit{M. Tsfasman} introduced a generalization of the Hamming metric, motivated by a model of transmissions over parallel channels, and obtained bounds on the cardinality of codes corresponding to the introduced metric. In this paper the author present this metric in a slightly more general setting using words over finite sets. By combination and modification of parameters he obtains some new bounds and improves in some cases the analogue of Plotkin bound. Also, the author discusses the following problem: which are the parameters such that there exist codes meeting the analog of Singleton bound in the considered metric? The binary case is solved.