Igor O. Zavadskyi

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
A new perspective family of universal variable length prefix codes with a set of delimiters is introduced. The main seed of these codes is the binary representation of natural numbers in the two-base numeration system with the main radix 2 and the auxiliary radix 3. We construct extensions and generalizations of these (2,3)-codes, which we call (Δ,(More)
Let <inline-formula> <tex-math notation="LaTeX">$m_{1},m_{2},\ldots, m_{t}$ </tex-math></inline-formula> be a fixed set of natural integers given in ascending order. A multi-delimiter code <inline-formula> <tex-math notation="LaTeX">$D_{m_{1},\ldots, m_{t}}$ </tex-math></inline-formula> consists of <inline-formula> <tex-math notation="LaTeX">$t$(More)
Variable-length splittable codes are derived from encoding sequences of ordered integer pairs, where one of the pair’s components is upper bounded by some constant, and the other one is any positive integer. Each pair is encoded by the concatenation of two fixed independent prefix encoding functions applied to the corresponding components of a pair. The(More)
A new class of forward error correcting codes is introduced. The main idea of the code construction is to utilize special arithmetic properties of input words and codewords considered as whole numbers in the process of encoding and decoding. The numbers are represented in the two-base numeration system with the main radix 2 and the auxiliary radix 3.
A family of comparison-based exact pattern matching algorithms is described. They utilize multi-dimensional arrays in order to process more than one adjacent text window in each iteration of the search cycle. This approach leads to a lower average time complexity by the cost of space. The algorithms of this family perform well for short patterns and middle(More)
  • 1