A length n binary word is q-decreasing, q?1, if every of its maximal factors the form 0a1b satisfies a=0 or q?a>b. In particular, in 1-decreasing words run 0s immediately followed by a strictly shorter 1s. We show constructively that these are bijection with having no occurrences 1q+1, and thus they enumerated (q+1)-generalized Fibonacci numbers. give some enumerative results reveal similaritie...

In this paper, a method of decreasing the redundancy information flow by using recurrent properties Galois code sequences is proposed. For purpose, service compiled and priority compression identified. The based on applying one adaptive algorithms (prediction first-order, interpolation zero-order, first-order) comparing efficiency its use when applied to selected fragments signal. It shown that...