It has been well known that the suitable criteria for Space time trellis codes (STTC) designed over slow Nakagami fading channel for product of rank and number of receiver antennas ) are maximization of minimum rank and maximize the minimum product of nonzero eigenvalues for rank and determinant criteria. But for large product i.e. for ), the design of codes with minimum error probability and m...

Multi-scale ordination (MSO) deals with potential scale-dependence in species assemblages, by studying how results from multivariate ordination may be different on different spatial scales. MSO methods were initially based on two-term local covariances between species, and therefore required sampling designs composed of adjacent quadrats. A variogram-based MSO, applicable to very diverse sampli...

In this paper we prove that a vertex-centered automorphism of a tree gives a proper factor of the characteristic polynomial of its distance or adjacency matrix. We also show that the characteristic polynomial of the distance matrix of any graph always has a factor of degree equal to the number of vertex orbits of the graph. These results are applied to full k-ary trees and some other problems. ...

For simplicial complexes and maps, the notion of being in same contiguity class is defined as discrete version homotopy. In this paper, we study distance, $SD$, between two maps adapted from homotopic distance. particular, show that versions $LS$-category topological complexity are particular cases more general notion. Moreover, present behaviour $SD$ under barycentric subdivision, its relation...