On check character systems over quasigroups and loops
Vernadsky National Library of Ukraine
Переглянути архів ІнформаціяПоле | Співвідношення | |
Title |
On check character systems over quasigroups and loops
|
|
Creator |
Belyavskaya, G.B.
|
|
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 a₁a₂...an₋₁ : a₁a₂...an₋₁ → a₁a₂...an₋₁an with the check formula (...((a₁ · δa₂) · δ ²a₃)...) · δ ⁿ⁻²an₋₁) · δ ⁿ⁻¹an = 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.
|
|
Date |
2019-06-17T10:47:49Z
2019-06-17T10:47:49Z 2003 |
|
Type |
Article
|
|
Identifier |
On check character systems over quasigroups and loops / G.B. Belyavskaya // Algebra and Discrete Mathematics. — 2003. — Vol. 2, № 2. — С. 1–13. — Бібліогр.: 9 назв. — англ.
1726-3255 2001 Mathematics Subject Classification: 20N05, 20N15, 94B60, 94B65. http://dspace.nbuv.gov.ua/handle/123456789/155694 |
|
Language |
en
|
|
Relation |
Algebra and Discrete Mathematics
|
|
Publisher |
Інститут прикладної математики і механіки НАН України
|
|