Skip to Main content Skip to Navigation
Journal articles

Some Bounds on the Size of Codes

Emanuele Bellini 1 Eleonora Guerrini 2 Massimiliano Sala 1
2 ECO - Exact Computing
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : We present one upper bound on the size of non-linear codes and its restriction to systematic codes and linear codes. This bound is independent of other known theoretical bounds, e.g. the Griesmer bound, the Johnson bound or the Plotkin bound, and it is an improvement of a bound by Litsyn and Laihonen. Our experiments show that in some cases (the majority of cases for some q) our bounds provide the best value, compared to all other theoretical bounds.
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download
Contributor : Eleonora Guerrini <>
Submitted on : Wednesday, March 9, 2016 - 4:53:35 PM
Last modification on : Thursday, July 5, 2018 - 3:32:11 PM

Links full text




Emanuele Bellini, Eleonora Guerrini, Massimiliano Sala. Some Bounds on the Size of Codes. IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 2014, 60 (3), pp.1475-1480. ⟨10.1109/TIT.2014.2298234⟩. ⟨lirmm-01282040⟩



Record views