A bound of the size of codes

Eleonora Guerrini 1 Emanuele Bellini 2 Sala Massimiliano 2
1 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.
Complete list of metadatas

Cited literature [11 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00805261
Contributor : Eleonora Guerrini <>
Submitted on : Wednesday, March 27, 2013 - 2:44:56 PM
Last modification on : Saturday, June 8, 2019 - 2:14:02 PM
Long-term archiving on: Friday, June 28, 2013 - 4:06:27 AM

File

Bound-codes.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : lirmm-00805261, version 1

Collections

Citation

Eleonora Guerrini, Emanuele Bellini, Sala Massimiliano. A bound of the size of codes. WCC: Workshop on Coding and Cryptography, Apr 2013, Bergen, Norway. pp.569-576. ⟨lirmm-00805261⟩

Share

Metrics

Record views

306

Files downloads

409