Skip to main content
Conference Proceedings

The complete weight enumerator for codes over Mn×s(Fq)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2001) 2260 20-26
DOI: 10.1007/3-540-45325-3_3
22Citations
Citations of this article
19Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The MacWilliams identity for codes over Mn×s (Fq) endowed with a non-Hamming metric is proved in [1]. We introduce a complete weight enumerator for these codes and prove a MacWilliams identity with respect to this new metric for the complete weight enumerator.

Cite

CITATION STYLE

APA

Siap, I. (2001). The complete weight enumerator for codes over Mn×s(Fq). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2260, pp. 20–26). Springer Verlag. https://doi.org/10.1007/3-540-45325-3_3

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