Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Conference papers

On the Griesmer bound for nonlinear codes

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [16 references]  Display  Hide  Download
Contributor : Jean-Pierre Tillich Connect in order to contact the contributor
Submitted on : Friday, February 19, 2016 - 8:11:33 AM
Last modification on : Friday, February 19, 2016 - 4:29:00 PM
Long-term archiving on: : Sunday, November 13, 2016 - 12:02:29 AM


Files produced by the author(s)


  • 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⟩



Record views


Files downloads