Back to Search
Start Over
On Rosenbloom and Tsfasman's generalization of the Hamming space
- Source :
-
Discrete Mathematics . Oct2007, Vol. 307 Issue 21, p2514-2524. 11p. - Publication Year :
- 2007
-
Abstract
- Abstract: Rosenbloom and Tsfasman introduced a generalization of the Hamming metric, motivated by a model of information transmission over parallel channels, and obtained bounds on the cardinality of codes in the induced finite metric space. In the present paper, some new bounds are given and the analogue of the Plotkin bound is improved. Furthermore, the following problem together with some results is presented: which are the parameters such that there exist codes meeting the Singleton bound in the new space? The binary case is solved. [Copyright &y& Elsevier]
- Subjects :
- *SET theory
*MATHEMATICS
*AGGREGATED data
*ARITHMETIC
Subjects
Details
- Language :
- English
- ISSN :
- 0012365X
- Volume :
- 307
- Issue :
- 21
- Database :
- Academic Search Index
- Journal :
- Discrete Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 26840880
- Full Text :
- https://doi.org/10.1016/j.disc.2007.01.005