On check character systems over quasigroups and loops

Please use this identifier to cite or link to this item: http://hdl.handle.net/123456789/57

Full metadata record

DC Field	Value	Language
dc.contributor.author	Belyavskaya, G. B.	-
dc.date.accessioned	2015-10-19T13:04:21Z	-
dc.date.available	2015-10-19T13:04:21Z	-
dc.date.issued	2003-04-23	-
dc.identifier.uri	http://hdl.handle.net/123456789/57	-
dc.description	In this article we study check character systems that is error detecting codes, which arise by appending a check digit an to every word a1a2...an−1 : a1a2...an−1 → a1a2...an−1an with the check formula (...((a1 · ±a2) · ±2a3)...) · ±n−2an−1) · ±n−1an = c, where Q(·) is a quasigroup or a loop, ± is a permutation of Q, c ∈ Q. We consider detection sets for such errors as transpositions (ab → ba), jump transpositions (acb → bca), twin errors (aa → bb) and jump twin errors (aca → bcb) and an automorphism equivalence (a weak equivalence) for a check character systems over the same quasigroup (over the same loop). Such equivalent systems detect the same percentage (rate) of the considered error types.	uk_UA
dc.language.iso	en	uk_UA
dc.publisher	Луганский национальный университет им. Т. Шевченко	uk_UA
dc.title	On check character systems over quasigroups and loops	uk_UA
dc.type	Article	uk_UA
Appears in Collections:	Статті

Files in This Item:

File	Description	Size	Format
adm-n2-2003-1.pdf		153.66 kB	Adobe PDF	View/Open

DSpace JSPUI