American Institute of Mathematical Sciences

Advanced
August  2008, 2(3): 261-272. doi: 10.3934/amc.2008.2.261

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

J. De Beule 1, , K. Metsch 2, and  L. Storme 1,

1. 

Dept. of Pure Mathematics and Computer Algebra, Ghent University, Krijgslaan 281, S22, B-9000 Gent, Belgium, Belgium
2. 

Mathematisches Institut, Universität Gieβen, Arndtstraβe 2, D-35392 Gieβen, Germany

Received  January 2008 Published  July 2008

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: Griesmer bound, Minihypers, blocking sets..
Mathematics Subject Classification: 05B25, 51E20, 51E21, 94B0.
Citation: J. De Beule, K. Metsch, L. Storme. Characterization results on weighted minihypers and on linear codes meeting the Griesmer bound. Advances in Mathematics of Communications, 2008, 2 (3) : 261-272. doi: 10.3934/amc.2008.2.261
[1]

Riccarda Rossi, Ulisse Stefanelli, Marita Thomas. Rate-independent evolution of sets. Discrete & Continuous Dynamical Systems - S, 2021, 14 (1) : 89-119. doi: 10.3934/dcdss.2020304
[2]

Wolfgang Riedl, Robert Baier, Matthias Gerdts. Optimization-based subdivision algorithm for reachable sets. Journal of Computational Dynamics, 2021, 8 (1) : 99-130. doi: 10.3934/jcd.2021005
[3]

Héctor Barge. Čech cohomology, homoclinic trajectories and robustness of non-saddle sets. Discrete & Continuous Dynamical Systems - A, 2020  doi: 10.3934/dcds.2020381
[4]

Christopher S. Goodrich, Benjamin Lyons, Mihaela T. Velcsov. Analytical and numerical monotonicity results for discrete fractional sequential differences with negative lower bound. Communications on Pure & Applied Analysis, 2021, 20 (1) : 339-358. doi: 10.3934/cpaa.2020269
[5]

Jing Zhou, Cheng Lu, Ye Tian, Xiaoying Tang. A socp relaxation based branch-and-bound method for generalized trust-region subproblem. Journal of Industrial & Management Optimization, 2021, 17 (1) : 151-168. doi: 10.3934/jimo.2019104

2019 Impact Factor: 0.734

Tools

Metrics

  • PDF downloads (46)
  • HTML views (0)
  • Cited by (3)

Other articles
by authors

[Back to Top]

Copyright © 2020 American Institute of Mathematical Sciences