Let C n,cn be a random constraint satisfaction problem(CSP) of n binary variables, where c > 0 is a fixed constant and the cn constraints are selected uniformly and independently from all the possible k-ary constraints each of which contains exactly t tuples of the values as its restrictions. We establish upper bounds for the tightness threshold for C n,cn to have an exponential resolution comp...

In diverse engineering problems including wireless communications, the estimate of the signal-to-noise ratio (SNR) is required. In this study, the authors develop a shrinkage-based SNR estimator in the data-aided and non-dataaided schemes for higher M-ary phase-shift-keying (M ≥ 8) and quadrature amplitude modulations. The observed Cramér-Rao lower bound is used as the variance of the expectati...

An early study on the structural aspect of binary constraint problems has led to the deenition of a backtrack bounded solving (bbs) method. In this paper, we apply this method to n-ary constraint problems and we try to weigh the beneets that can be expected from its use. Simple functions are described to implement bbs for acyclic n-ary problems and results of an experimental performance evaluat...

The global avalanche characteristics criteria was first introduced by Zhou et al. (Inform. Sci. 180(2) (2010) 256-265). This article is concerned with some new bounds on global avalanche characteristics of two q-ary functions. Based on the above result we obtain a bound on σf of f ∈ Bn,q in terms of σ′ f`s of the restricted functions on Zqn−1, and construct a class of q-ary bent functions from ...

In this paper, we find a family of -ary sequences with ideal two-level autocorrelation with symbols in the finite field . The proposed family may be considered as a generalization of the well-known nonbinary sequences introduced by Helleseth and Gong. Using the constructed sequences and -sequences, we present a family of -ary sequences of which the correlation property is optimal in terms of th...

We provide a simple, closed-form upper bound for the classical problem of worst case list-size of a general q-ary block code. This new bound improves upon the best known general bound when the alphabet of the code is large. We also show that with parameters of Reed-Solomon codes this bound is very close to the algebraic bound derived using the constructions of the Guruswami-Sudan decoder.

In this paper, we have generalized the definition of vector space by considering the group as a canonical $m$-ary hypergroup, the field as a krasner $(m,n)$-hyperfield and considering the multiplication structure of a vector by a scalar as hyperstructure. Also we will be consider a normed $m$-ary hypervector space and introduce the concept of convergence of sequence on $m$-ary hypernormed space...

The problem of providing bounds on the redundancy of an optimal code for a discrete memoryless source in terms of the probability distribution of the source, has been extensively studied in the literature. The attention has mainly focused on binary codes for the case when the most or the least likely source letter probabilities are known. In this paper we analyze the relationships among tight l...

Supportive wireless communication relay network in OFDMbased systems have shown to expand performance in countless system using digital modulation techniques as a form of spatial diversity, but are not gladly available cp-operative variety for M –ary QAM OFDM based system where the best relay only participates in the relaying. In this paper we compute the error rate performance of cooperative V...

The coding matrix design plays a fundamental role in the prediction performance of the error correcting output codes (ECOC)-based multi-class task. In many-class classification problems, e.g., fine-grained categorization, it is difficult to distinguish subtle between-class differences under existing coding schemes due to a limited choices of coding values. In this paper, we investigate whether ...