A k-ary necklace of order n is an equivalence class of strings of length n of symbols from {0, 1, . . . , k − 1} under cyclic rotation. In this paper we define an ordering on t...
This paper focuses on numerical function generators (NFGs) based on k-th order polynomial approximations. We show that increasing the polynomial order k reduces significantly the...
—In this paper we present a new theoretical model to assess the performance of a class of batch scheduling orders in a forward DVB-S2 satellite link. The scheduling order in a DV...
Abstract. A lexicographic ranking function for the set of all permutations of n ordered symbols translates permutations to their ranks in the lexicographic order of all permutation...
An iterative scheme for constructing compactly supported orthonormal (o.n.) multi-wavelets with vanishing moments of arbitrarily high order is established. Precisely, let = [1,