We investigate codes that meet this bound with equality. We give new descriptions of (\sum_{i=0}^{k-1}\lceil d/2^{i} \rceil , k, d) codes that have earlier been ...
The scope of this paper is to show how to construct new codes meeting the Griesmer bound. In particular most of the previously known such codes will turn out to ...
This work investigates codes that meet the Grfesmer bound and shows how to construct several new families of such codes with parameters not obtainable by ...
Sep 1, 2006 · We investigate codes that meet this bound with equality. We give new descriptions of (sum_{i=0}^{k-1}lceil d/2^{i} rceil, k, d) codes that have ...
Prominent examples of codes meeting the Griesmer bound are the simplex code and the [5,6,11]3 Golay code. Many authors have investigated classes of codes ...
Article on New constructions of codes meeting the Griesmer bound, published in IEEE Transactions on Information Theory 29 on 1983-05-01 by T Helleseth.
Griesmer's bound is well known as a lower bound on n for given integers k, d and q. Linear codes meeting the Griesmer bound are called optimal linear codes.
Mar 26, 2022 · I need to show that binary linear codes meeting equality on this bound have a basis made of d-weight code words.
Missing: constructions | Show results with:constructions
Abstract 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 ...
Mar 27, 1992 · Such a code would meet the Griesmer bound. The purpose of this paper is to give a constructive proof of the existence of [q 4 + q 2 − q, 5, ...