It is well known that the k-ary n-cube has been one of the most efficient interconnection networks for distributed-memory parallel systems. A k-ary n-cube is bipartite if and only if k is even. Let (X,Y ) be a bipartition of a k-ary 2-cube (even integer k ≥ 4). In this paper, we prove that for any two healthy vertices u ∈ X, v ∈ Y , there exists a hamiltonian path from u to v in the faulty k-ar...

By adopting natural generalizations of relational frame and relational model we showed in [2] that the deontic law D, Dp -» Op, is not universally first-order definable. In effect, we showed there that for n > 2, there is no n-adic first-order sentence p such that for every n-ary frame F,F ^D iff F ^(3 in the first-order sense. The notion of n-ary frame and model employed there may be summarize...

We determine the dimension of certain q-ary algebraic-geometric trace codes, extending previous results of Van Der Vlugt for p-ary algebraicgeometric trace codes.

The characterization and construction of bent functions are challenging problems. The paper generalizes the constructions of Boolean bent functions by Mesnager [33], Xu et al. [40] and p-ary bent functions by Xu et al. [41] to the construction of p-ary weakly regular bent functions and presents new infinite families of p-ary weakly regular bent functions from some known weakly regular bent func...