QUASIGROUP STRING PROCESSING: PART 4 | Zendy

Smile Markovski | Zendy; Verica Bakeva | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

QUASIGROUP STRING PROCESSING: PART 4

Author(s) -

Smile Markovski,

Verica Bakeva

Publication year - 2017

Publication title -

contributions section of natural mathematical and biotechnical sciences

Language(s) - English

Resource type - Journals

eISSN - 1857-9949

pISSN - 1857-9027

DOI - 10.20903/csnmbs.masa.2006.27.1-2.5

Subject(s) - quasigroup , alphabet , tuple , string (physics) , transformation (genetics) , cryptography , set (abstract data type) , mathematics , coding (social sciences) , discrete mathematics , computer science , algebra over a field , algorithm , pure mathematics , programming language , philosophy , linguistics , biochemistry , chemistry , statistics , mathematical physics , gene

A b s t r a c t: Given a ¯nite alphabet A and a quasigroup operation ¤ on the set A, in earlier paper of ours we have de¯ned the quasigroup transformation E : A+ ! A+, where A+ is the set of all ¯nite strings with letters from A. Here we present several generalizations of the transformation E and we consider the conditions under which the transformed strings have uniform distributions of n-tuples of letters of A. The obtained results can be applied in cryptography, coding theory, de¯ning and improving pseudo random generators, and so on.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research