Skip to main content
Conference Proceedings

On generalized hamming weights for codes over finite chain rings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2001) 2227 141-150
DOI: 10.1007/3-540-45624-4_15
11Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we introduce the generalized Hamming weights with respect to rank (GHWR), from a module theoretical point of view, for linear codes over finite chain rings. We consider some basic properties of GHWR.

Cite

CITATION STYLE

APA

Horimoto, H., & Shiromoto, K. (2001). On generalized hamming weights for codes over finite chain rings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2227, pp. 141–150). Springer Verlag. https://doi.org/10.1007/3-540-45624-4_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free