On Optimal Nonlinear Systematic Codes - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Journal Articles IEEE Transactions on Information Theory Year : 2016

On Optimal Nonlinear Systematic Codes

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.

Dates and versions

lirmm-01325813 , version 1 (02-06-2016)

Identifiers

Cite

Eleonora Guerrini, Alessio Meneghetti, Massimiliano Sala. On Optimal Nonlinear Systematic Codes. IEEE Transactions on Information Theory, 2016, 62 (6), pp.3103-3112. ⟨10.1109/TIT.2016.2553142⟩. ⟨lirmm-01325813⟩
141 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More