Nowadays, the dissemination of information touches the distributed world, where selecting the relevant servers to a user request is an important problem in distributed information retrieval. During the last decade, several research studies on this issue have been launched to find optimal solutions and many approaches of collection selection have been proposed. In this paper, we propose a new collection selection approach that takes into consideration the number of documents in a collection that contains terms of the query and the weights of those terms in these documents. We tested our method and our studies show that this technique can compete with other state-of-the-art algorithms that we choose to test the performance of our approach.

In this paper, we introduce the homogeneous weight and homogeneous Gray map over the ring Rq=F2[u1,u2,…,uq]/⟨u2i=0,uiuj=ujui⟩ for q>=1q>=1. We also consider the construction of simplex and MacDonald codes of types α and β over this ring and their covering radius.

In this paper, we introduce the homogeneous weight and homogeneous Gray map over the ring Rq=F2[u1,u2,…,uq]/⟨u2i=0,uiuj=ujui⟩ for q>=1q>=1. We also consider the construction of simplex and MacDonald codes of types α and β over this ring and their covering radius.

In this paper, we introduce the homogeneous weight and homogeneous Gray map over the ring Rq=F2[u1,u2,…,uq]/⟨u2i=0,uiuj=ujui⟩ for q>=1q>=1. We also consider the construction of simplex and MacDonald codes of types α and β over this ring and their covering radius.