- Full text PDF available (3)
- This year (0)
- Last 5 years (1)
- Last 10 years (2)
Journals and Conferences
We suggest a general method of the construction of secret-sharing schemes based on orthogonal systems of partial (in particular, everywhere determined) k-ary operations which generalizes some known methods of the construction of such schemes by a nite elds and point the orthogonal systems of k-ary operations respecting to these known schemes. The di erent… (More)
Systems of k-ary operations, k > 2, generalizing orthogonal sets are considered. These systems have the following property: every k successive k-ary operations of the system are orthogonal. We call these systems successively orthogonal, establish some properties, give examples and methods of construction of these systems.
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… (More)