A bound of the size of codes - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier
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.

Domains

Information Theory [cs.IT] Information Theory [math.IT]
Fichier principal
Vignette du fichier
Bound-codes.pdf (138.87 Ko) Télécharger le fichier
Origin Publisher files allowed on an open archive

Eleonora Guerrini  : Connect in order to contact the contributor

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00805261

Submitted on : Wednesday, March 27, 2013-2:44:56 PM

Last modification on : Wednesday, March 20, 2024-3:10:41 AM

Long-term archiving on : Friday, June 28, 2013-4:06:27 AM

Download

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⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CNRS ECO LIRMM MIPS UNIV-MONTPELLIER
191 View
282 Download

Share

More