A New Class of Nonbinary Codes Meeting the Griesmer Bound
نویسندگان
چکیده
A new class of codes over GF(q’) that meet the Griesmer bound are constructed in a simple way from the Solomon and Stiffler codes over GF(q). The new codes are, in general, not equivalent to the Solomon and Stiffler codes whenever I > 1.
منابع مشابه
On codes meeting the Griesmer bound
We investigate codes meeting the Griesmer bound. The main theorem of this article is the generalization of the nonexistence theorem of [7] to a larger class of codes. keywords: Griesmer bound, extending codes, nonexistence theorem, code construction
متن کاملParameters for which the Griesmer bound is not sharp
7 We prove for a large class of parameters t and r that a multiset of at most t d−k + r d−k−2 points in PG(d, q) that blocks every k-dimensional subspace at least t times must contain a sum of t subspaces of codimension k. 9 We use our results to identify a class of parameters for linear codes for which the Griesmer bound is not sharp. Our theorem generalizes the non-existence results from Maru...
متن کاملNew classification results for a certain class of weighted minihypers
Minihypers were introduced for their relation with linear codes meeting the Griesmer bound. Results on minihypers have therefore important applications in coding theory. On the other hand, minihypers are nice geometrical structures since they are a generalization of blocking sets, which have been studied a lot. Therefore also minihypers deserve to be studied from a purely geometrical point of v...
متن کاملCharacterization results on weighted minihypers and on linear codes meeting the Griesmer bound
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. 1. Linear codes meeting the Griesme...
متن کاملDivisibility of Codes Meeting the Griesmer Bound
The brackets of ``[n, k, d]'' signal that C is linear, and n is the length, k the dimension, and d the minimum weight of C. The bound was proved by Griesmer in 1960 for q=2 and generalized by Solomon and Stiffler in 1965. Over the years, much effort has gone into constructing codes meeting the bound or showing, for selected parameter values, that they do not exist. This effort is part of the mo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 47 شماره
صفحات -
تاریخ انتشار 1993