A Non-linear Split Error Detection Code

  • Authors:
  • Michael Gö/ssel;Egor Sogomonyan

  • Affiliations:
  • Universitä/t Potsdam, Institut fü/r Informatik, August-Bebel-Str. 89, 14482 Potsdam, Germany. E-mails: mgoessel@cs.uni-potsdam.de/ egor@cs.uni-potsdam.de;Universitä/t Potsdam, Institut fü/r Informatik, August-Bebel-Str. 89, 14482 Potsdam, Germany. E-mails: mgoessel@cs.uni-potsdam.de/ egor@cs.uni-potsdam.de

  • Venue:
  • Fundamenta Informaticae
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper a new non-linear error detection code with three non-linear check bits and an even number of k information bits is introduced. The proposed code may be considered as a modified parity code. The parity bit is split into two non-linear check bits and a third non-linear check bit is added. All odd errors are detected with certainty. All (also even) errors of arbitrary multiplicity for which at least one of the information bits is correct are detected with a probability greater than or equal to 1/2.