In this paper from q-ary perfect codes new completely regular q-ary codes are constructed. In particular, two new ternary completely regular codes are obtained from ternary Golay [11, 6, 5] code. The first [11, 5, 6] code with covering radius ρ = 4 coincides with the dual Golay code and its intersection array is (22, 20, 18, 2, 1; 1, 2, 9, 20, 22) . The second [10, 5, 5] code, with covering rad...

Despite the popularity and practical importance of fuzzy inference system (FIS), use an FIS model as n -ary aggregation function, which is characterized by both monotonicity boundary properties, yet to be established. This because research on ensuring that models satisfy property, i.e., monoton...

This paper concerns a relationship between soft sets and n-ary polygroups. We consider the notion of an n-ary polygroup as a generalization of a polygroup and apply the notion of soft sets to n-ary polygroups. Some related notions are defined and several basic properties are discussed by using the soft set theory. Furthermore, we propose the homomorphism of n-ary polygroups and investigate the ...

In this paper, we define the strongly compatible relation ε on the (m,n)ary hypermodule M, so that the quotient (M/ε∗, h/ε∗) is an (m,n)-ary module over the fundamental (m,n)-ary ring (R/Γ∗, f/Γ∗, g/Γ∗). Also, we determine a family P (M) of subsets of an (m,n)-ary hypermodule M and we give a sufficient condition such that the geometric space (M,P (M)) is strongly transitive. Mathematics Subject...

The h-extra connectivity is an important parameter to measure the reliability and fault tolerance ability of large interconnection networks. The k-ary ncube is an important interconnection network of parallel computing systems. The 1-restricted connectivity of k-ary n-cubes has been obtained by Chen et al. for k ≥ 4 in [6]. Nevertheless, the h-extra connectivity of 3-ary ncubes has not been obt...

An n-ary operation Q : Σ → Σ is called an n-ary quasigroup of order |Σ| if in the equation x0 = Q(x1, . . . , xn) knowledge of any n elements of x0, . . . , xn uniquely specifies the remaining one. Q is permutably reducible if Q(x1, . . . , xn) = P ( R(xσ(1), . . . , xσ(k)), xσ(k+1), . . . , xσ(n) ) where P and R are (n− k+1)-ary and kary quasigroups, σ is a permutation, and 1 < k < n. Anm-ary ...