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

J. De Beule; K. Metsch; L. Storme

doi:10.3934/amc.2008.2.261

Article Contents

2008, Volume 2, Issue 3: 261-272. Doi: 10.3934/amc.2008.2.261

This issue Previous Article How to say yes, no and maybe with visual cryptography Next Article Skew constacyclic codes over Galois rings

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

1.
Dept. of Pure Mathematics and Computer Algebra, Ghent University, Krijgslaan 281, S22, B-9000 Gent
2.
Mathematisches Institut, Universität Gieβen, Arndtstraβe 2, D-35392 Gieβen

Received: December 31, 2007

Published: July 2008

Abstract Related Papers Cited by

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.

Keywords:

Mathematics Subject Classification: 05B25, 51E20, 51E21, 94B05.

Citation:

Article Metrics

HTML views() PDF downloads(105) Cited by(0)

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

Abstract

Access History

Article Metrics

Access History

Other Articles By Authors

Catalog

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

Abstract

Access History

SHARE

Article Metrics

Access History

Other Articles By Authors

Catalog

Export File

Citation

Format

Content