On the Griesmer bound for nonlinear codes - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2016

On the Griesmer bound for nonlinear codes


Most bounds on the size of codes hold for any code, whether linear or nonlinear. Notably, the Griesmer bound holds only in the linear case. In this paper we identify code parameters (q, d, k) for which the Griesmer bound holds also in the (systematic) nonlinear case. Moreover, we show that the Griesmer bound does not necessarily hold for a systematic code by showing explicit counterexamples. On the other hand, we are also able to provide some versions of the Griesmer bound holding for all systematic codes.
Fichier principal
Vignette du fichier
wcc15-tu3-4.pdf (211.14 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01276224 , version 1 (19-02-2016)


  • HAL Id : hal-01276224 , version 1


Emanuele Bellini, Alessio Meneghetti. On the Griesmer bound for nonlinear codes. WCC2015 - 9th International Workshop on Coding and Cryptography 2015, Anne Canteaut, Gaëtan Leurent, Maria Naya-Plasencia, Apr 2015, Paris, France. ⟨hal-01276224⟩


31 View
213 Download


Gmail Facebook X LinkedIn More