Add to ORKGThe rank distance is a low-complexity and robust distance between sequences, which has been used in computational linguistics and bioinformatics. We tackle the problem of maximizing rank distances; in particular, we solve the problem of exhibiting sequences at largest rank distance from a given binary sequence
From social choice to statistics to coding theory, rankings are found to be a useful vehicle for sto...
Comparison functions for sequences (of symbols) are important components of many applications, for e...
Sequence representations supporting queries access, select and rank are at the core of many data str...
AbstractThis paper presents some computational properties of the rank-distance, a measure of similar...
This paper aims to present a new genetic approach that uses rank distance for solving two known NP-h...
Binary encoding on high-dimensional data points has attracted much attention due to its computationa...
Binary encoding on high-dimensional data points has at-tracted much attention due to its computation...
In this paper, we properly extend the family of rank-metric codes recently found by Longobardi and Z...
Viewing the codewords of an $[n,k]$ linear code over a field $F_{q^m}$ as ${m} X {n}$ matrices over ...
International audienceIn this paper, we rst recall some basic facts about rank metric. We then deriv...
We give an infinite family of maximum rank distance (MRD) codes, which covers properly the largest k...
By exploring some geometry of Segre varieties and Veronese varieties, new families of non linear max...
In the last decade there has been a great interest in extending results for codes equipped with the ...
The rank metric measures the distance between two matrices by the rank of their difference. Codes de...
Abstract. We study properties of rank metric and codes in rank metric over finite fields. We show th...
From social choice to statistics to coding theory, rankings are found to be a useful vehicle for sto...
Comparison functions for sequences (of symbols) are important components of many applications, for e...
Sequence representations supporting queries access, select and rank are at the core of many data str...
AbstractThis paper presents some computational properties of the rank-distance, a measure of similar...
This paper aims to present a new genetic approach that uses rank distance for solving two known NP-h...
Binary encoding on high-dimensional data points has attracted much attention due to its computationa...
Binary encoding on high-dimensional data points has at-tracted much attention due to its computation...
In this paper, we properly extend the family of rank-metric codes recently found by Longobardi and Z...
Viewing the codewords of an $[n,k]$ linear code over a field $F_{q^m}$ as ${m} X {n}$ matrices over ...
International audienceIn this paper, we rst recall some basic facts about rank metric. We then deriv...
We give an infinite family of maximum rank distance (MRD) codes, which covers properly the largest k...
By exploring some geometry of Segre varieties and Veronese varieties, new families of non linear max...
In the last decade there has been a great interest in extending results for codes equipped with the ...
The rank metric measures the distance between two matrices by the rank of their difference. Codes de...
Abstract. We study properties of rank metric and codes in rank metric over finite fields. We show th...
From social choice to statistics to coding theory, rankings are found to be a useful vehicle for sto...
Comparison functions for sequences (of symbols) are important components of many applications, for e...
Sequence representations supporting queries access, select and rank are at the core of many data str...