Linear recursive sequences over Galois rings

Abstract

To date, various connection rerouting methods for connection-oriented mobile networks have been proposed. The previous methods, however, are limited to specific topologies or environments. In this paper, we propose the connection-information-based rerouting widely applicable to various connection-oriented mobile networks. This method requires neither a specific topology nor a complex connection, enables fast rerouting, provides appropriate route optimality, and can be extended easily.

Distribution properties of compressing sequences derived from primitive sequences modulo odd prime powers

“…By Proposition 7, we have β = λ • α with λ = 0. By (8), we can choose t such that α(t) = k and a e−1 (t) = 0. If for this t we have b e−1 (t) = δ, then from ( 7), ( 8) and ( 9), we have…”

Expansion and linear complexity of the coordinate sequences over Galois rings

“…), are used significantly in cryptography, coding and communication applications [10,9,7]. Some results on the linear complexity of coordinate sequences have been achieved [10,9,7,4,3,2]; in [2] an expression for a k (t) in terms of elementary symmetric functions is given by Kumar and Helleseth for the case of p = 2. In this paper, we study the same problem for the general p case.…”

On s-uniform property of compressing sequences derived from primitive sequences modulo odd prime powers

“…, x e−1 ) is called an injective function ifφ is injective. Huang and Dai in [4, Theorem 1] and Kuzmin and Nechaev in [5,Theorem 2] independently proved that φ(x 0 , x 1 , . .…”