Check character systems using quasigroups: I

G. B. Belyavskaya, V. I. Izbash, G. L. Mullen

Research output: Contribution to journalArticlepeer-review

8 Scopus citations

Abstract

We consider check character systems with one check character over an arbitrary quasigroup under different check equations which have one permutation. The aim of using such a system is to discover transmission errors. These systems always detect all single errors (that is errors only one component of a code word). We establish necessary and sufficient conditions for a general quasigroup check character system over this quasigroup to be able to detect all transpositions. jump transpositions, twin errors and jump twin errors. We also study capabilities of check character systems over loops, in particular, over Moufang loops and groups when the permutation in the check equations is the identify permutation.

Original languageEnglish (US)
Pages (from-to)215-227
Number of pages13
JournalDesigns, Codes, and Cryptography
Volume37
Issue number2
DOIs
StatePublished - Nov 2005

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science Applications
  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Check character systems using quasigroups: I'. Together they form a unique fingerprint.

Cite this