On Rosenbloom and Tsfasman's generalization of the Hamming space

@article{Quistorff2007OnRA,
  title={On Rosenbloom and Tsfasman's generalization of the Hamming space},
  author={J{\"o}rn Quistorff},
  journal={Discrete Mathematics},
  year={2007},
  volume={307},
  pages={2514-2524}
}
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… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-2 of 2 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 19 references

Codes for the m-metric

  • M. Y. Rosenbloom, M. A. Tsfasman
  • Problems Inform. Transmission 33 (1997) 45–52; M…
  • 1997
Highly Influential
9 Excerpts

Orthogonal arrays of index unity

  • K. A. Bush
  • Ann. Math. Statist. 23
  • 1952
Highly Influential
2 Excerpts

On the structure and decoding of linear codes with respect to the Rosenbloom–Tsfasman metric

  • M. Ozen, I. Siap
  • Selçuk J. Appl. Math. 5
  • 2004
1 Excerpt

A class of Sudan-decomposable codes

  • R. Refslund Nielsen
  • IEEE Trans. Inform. Theory 46
  • 2000
3 Excerpts

Codes for the mmetric , Problems Inform

  • M. A. Tsfasman
  • 2000

Similar Papers

Loading similar papers…