A bound of the size of codes - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2013

A bound of the size of codes

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.
Fichier principal
Vignette du fichier
Bound-codes.pdf (138.87 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

lirmm-00805261 , version 1 (27-03-2013)

Identifiers

  • HAL Id : lirmm-00805261 , version 1

Cite

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⟩
187 View
277 Download

Share

Gmail Facebook X LinkedIn More