Characterization results on weighted minihypers and on linear codes meeting the griesmer bound

7Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

We present characterization results on weighted minihypers. We prove the weighted version of the original results of Hamada, Helleseth, and Maekawa. Following from the equivalence between minihypers and linear codes meeting the Griesmer bound, these characterization results are equivalent to characterization results on linear codes meeting the Griesmer bound. © 2008 AIMS-SDU.

Cite

CITATION STYLE

APA

De Beule, J., Metsch, K., & Storme, L. (2008). Characterization results on weighted minihypers and on linear codes meeting the griesmer bound. Advances in Mathematics of Communications, 2(3), 261–272. https://doi.org/10.3934/amc.2008.2.261

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