Logo image
Se connecter
A bound of the size of codes
Acte de colloque   Open Access

A bound of the size of codes

Eleonora Guerrini, Emanuele Bellini et Sala Massimiliano
8th International Workshop on Coding and Cryptography, Vol.1, pp.569-576
WCC: Workshop on Coding and Cryptography (Bergen, Norway, 15/04/2013–19/04/2013)
16/04/2013

Résumé

Bornes combinatoires Théorie de codes correcteurs
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.

Fichiers et liens (1)

url
Find in HALAfficher

Indicateurs

1 Consultations de la notice

Détails

Logo image