On Optimal Nonlinear Systematic Codes

Eleonora Guerrini 1, 2 Alessio Meneghetti 3 Massimiliano Sala 4
1 ARITH - Arithmétique informatique
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
2 ECO - Exact Computing
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : Most bounds on the size of codes hold for any code, whether linear or not. Notably, the Griesmer bound holds only in the linear case and so optimal linear codes are not necessarily optimal codes. In this paper, we identify code parameters (q,d,k) , namely, field size, minimum distance, and combinatorial dimension, for which the Griesmer bound also holds in the (systematic) nonlinear case. Moreover, we show that the Griesmer bound does not necessarily hold for a systematic code by explicit construction of a family of optimal systematic binary codes. On the other hand, we are able to provide some versions of the Griesmer bound holding for all the systematic codes.
Type de document :
Article dans une revue
IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 2016, 62 (6), pp.3103-3112. 〈10.1109/TIT.2016.2553142〉
Liste complète des métadonnées

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01325813
Contributeur : Eleonora Guerrini <>
Soumis le : jeudi 2 juin 2016 - 16:51:55
Dernière modification le : jeudi 11 janvier 2018 - 06:27:05

Identifiants

Collections

Citation

Eleonora Guerrini, Alessio Meneghetti, Massimiliano Sala. On Optimal Nonlinear Systematic Codes. IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 2016, 62 (6), pp.3103-3112. 〈10.1109/TIT.2016.2553142〉. 〈lirmm-01325813〉

Partager

Métriques

Consultations de la notice

56