We consider linear rank-metric codes in Fqm . We show that the properties of being MRD (maximum rank distance) and non-Gabidulin are generic over the algebraic closure of the underlying field, which implies that over a large extension field a randomly chosen generator matrix generates an MRD and a non-Gabidulin code with high probability. Moreover, we give upper bounds on the respective probabi...

In this paper, we study properties of rank metric codes in general and maximum rank distance (MRD) codes in particular. For codes with the rank metric, we first establish Gilbert and sphere-packing bounds, and then obtain the asymptotic forms of these two bounds and the Singleton bound. Based on the asymptotic bounds, we observe that asymptotically Gilbert-Varsharmov bound is exceeded by MRD co...

In this paper, we first introduce the concept of elementary linear subspace, which has similar properties to those of a set of coordinates. We then use elementary linear subspaces to derive properties of maximum rank distance (MRD) codes that parallel those of maximum distance separable (MDS) codes. Using these properties, we show that, for MRD codes with error correction capability t, the deco...

We consider a classical problem in choice theory – vote aggregation – using novel distance measures between permutations that arise in several practical applications. The distance measures are derived through an axiomatic approach, taking into account various issues arising in voting with side constraints. The side constraints of interest include non-uniform relevance of the top and the bottom ...

Rank-width is a graph complexity measure that has many structural properties. It is known that the rank-width of an undirected graph is the maximum over all induced prime graphs with respect to split decomposition and an undirected graph has rank-width at most 1 if and only if it is a distance-hereditary graph. We are interested in an extension of these results to directed graphs. We give sever...

We prove that every graph of rank-width k is a pivot-minor of a graph of tree-width at most 2k. We also prove that graphs of rank-width at most 1, equivalently distance-hereditary graphs, are exactly vertex-minors of trees, and graphs of linear rank-width at most 1 are precisely vertex-minors of paths. In addition, we show that bipartite graphs of rank-width at most 1 are exactly pivot-minors o...

We prove that every graph of rank-width k is a pivot-minor of a graph of tree-width at most 2k. We also prove that graphs of rank-width at most 1, equivalently distance-hereditary graphs, are exactly vertex-minors of trees, and graphs of linear rank-width at most 1 are precisely vertex-minors of paths. In addition, we show that bipartite graphs of rank-width at most 1 are exactly pivot-minors o...

Introduction: In many applications, ranking of fuzzy numbers is an important component of the decision process. Many authors have investigated the use of fuzzy sets in ranking alternatives and they have studied different methods of raking fuzzy sets. Particularly, the ranking of fuzzy numbers. In a paper by Cheng [A new approach for ranking fuzzy numbers by distance method, Fuzzy Sets and Syste...

In this paper, we first of all define the distance measure entitled generalized Hausdorff distance between two trapezoidal generalized fuzzy numbers (TGFNs) that has been introduced by Chen [10]. Then using a other distance and combining with generalized Hausdorff distance, we define the similarity measure. The basic properties of the above mentioned similarity measure are proved in detail. Fin...

Near-duplicate detection is important when dealing with large, noisy databases in data mining tasks. In this paper, we present the results of applying the Rank distance and the Smith-Waterman distance, along with more popular string similarity measures such as the Levenshtein distance, together with a disjoint set data structure, for the problem of near-duplicate detection.