This paper surveys parts of the study of divisibility properties of codes. The survey begins with the motivating background involving polynomials over nite elds. Then it presents recent results on bounds and applications to optimal codes.

This paper proposes to unify fading distributions by modeling the magnitude-squared of the instantaneous channel gain as an infinitely divisible random variable. A random variable is said to be infinitely divisible, if it can be written as a sum of n ≥ 1 independent and identically distributed random variables, for each n. Infinitely divisible random variables have many interesting mathematical...

the aim of this study is to study the nomad women's indigenous knowledge of housing in tribes of kalhor kalhor. the study was a done by qualitative approach, using participatory methods pra, and focus groups in the gilan e gharb city of kermanshah province. the results were analyzed by content analysis. purposeful sampling was used for data collection. findings from real-life context of tr...

In this paper a general theory of a random number of random variables is constructed. A description of all random variables ν admitting an analog of the Gaussian distribution under ν-summation, that is, the summation of a random number ν of random terms, is given. The ν-infinitely divisible distributions are described for these ν-summations and finite estimates of the approximation of ν-sum dis...

In this paper we consider a class of economies with a ̄nite number of divisible commodities, linear production technologies, and indivisible goods, and a ̄nite number of agents. This class contains several well-known economies with indivisible goods and money as special cases. It is shown that if the utility functions are continuous on the divisible commodities and are weakly monotonic both on ...

Divisible e-cash systems allow a user to withdraw a wallet containingK coins and to spend k ≤ K coins in a single operation, respectively. Independent of the new work of Canard, Pointcheval, Sanders and Traoré (Proceedings of PKC ’15) we present a practical and secure divisible e-cash system in which the bandwidth of each protocol is constant while the system fulfills the standard security requ...

A fundamental theorem of Wilson states that, for every graph F , every sufficiently large F -divisible clique has an F -decomposition. Here a graph G is F -divisible if e(F ) divides e(G) and the greatest common divisor of the degrees of F divides the greatest common divisor of the degrees of G, and G has an F -decomposition if the edges of G can be covered by edge-disjoint copies of F . We ext...

Abstract In this paper, a new upper bound for the Multiple Knapsack Problem (MKP) is proposed, based on idea of relaxing MKP to Bounded Sequential Problem, i.e., multiple knapsack problem in which item sizes are divisible. Such relaxation, called sequential obtained by suitably replacing items instance with divisible sizes. Experimental results benchmark instances show that effective, terms qua...