On Fixed Length Systematic All Limited Magnitude Zero Deletion/Insertion Error Control Codes*

In a systematic code (systematic in the strict sense) a check symbol is appended to the data word. Here, the theory and design of systematic binary block codes capable of correcting
$t$
insertion and/or deletion of the symbol 0 in each and every 0-run is studied. This problem is related to the zero error capacity achieving systematic codes in limited magnitude error channels. Optimal and sub-optimal systematic code designs and the encoding/decoding algorithms are given.