On Optimal Nonlinear Systematic Codes

DOI10.1109/TIT.2016.2553142MaRDI QIDQ2976759zbMATH OpenOpenAlexFDO

Authors Eleonora Guerrini, Alessio Meneghetti, Massimiliano Sala

Publication date 28 April 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1506.03227

Mathematics Subject Classification ID

Combinatorial codes (94B25)

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 dimension, for which the Griesmer bound holds also 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 systematic codes.

Recommendations

• An optimum nonlinear code
• On Optimal Coding of Non-Linear Dynamical Systems
• On new perfect binary nonlinear codes
• scientific article; zbMATH DE number 3340918
• New Class of Nonlinear Systematic Error Detecting Codes
• Nonsystematic perfect codes
• On optimal non-projective ternary linear codes
• Computing the distance distribution of systematic nonlinear codes
• scientific article; zbMATH DE number 1498836
• Publication:3026904

Cited in

(2)

• Communication code generation in systems of affine recurrence equations
• Systematic encoding of the Varshamov-Tenengol'ts codes and the Constantin-Rao codes

This page was built for publication: On Optimal Nonlinear Systematic Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2976759)