Results 31 to 40 of about 2,883,021 (288)
On the roots and minimum rank distance of skew cyclic codes [PDF]
Des. Codes Cryptogr., 2015 Skew cyclic codes play the same role as cyclic codes in the theory of error-correcting codes for the rank metric. In this paper, we give descriptions of these codes by root spaces, cyclotomic spaces and idempotent generators. We prove that the lattice of
Umberto Martínez-Peñas
semanticscholar +1 more source
Construction of Minimum Spanning Trees from Financial Returns using Rank Correlation [PDF]
Physica A: Statistical Mechanics and its Applications, 2020 The construction of minimum spanning trees (MSTs) from correlation matrices is an often used method to study relationships in the financial markets. However most of the work on this topic tends to use the Pearson correlation coefficient, which relies on ...
Tristan Millington, M. Niranjan
semanticscholar +1 more source
IEEE Access, 2020 To improve the visual quality of noisy medical images acquired by low radiation dose imaging, medical image denoising is highly desirable for clinical disease diagnosis.
Linlin Ji, Qiang Guo, Mingli Zhang
doaj +1 more source
The Minimum Rank of a Correlation Matrix [PDF]
Proceedings of the National Academy of Sciences, 1944 Not ...
openaire +2 more sources
The minimum rank problem: A counterexample
Linear Algebra and its Applications, 2008 We provide a counterexample to a recent conjecture that the minimum rank of every sign pattern matrix can be realized by a rational matrix. We use one of the equivalences of the conjecture and some results from projective geometry. As a consequence of the counterexample, we show that there is a graph for which the minimum rank over the reals is ...
Kopparty, Swastik, Bhaskara Rao, K.P.S.
openaire +3 more sources
Achievable multiplicity partitions in the inverse eigenvalue problem of a graph
Special Matrices, 2019 Associated to a graph G is a set 𝒮(G) of all real-valued symmetric matrices whose off-diagonal entries are nonzero precisely when the corresponding vertices of the graph are adjacent, and the diagonal entries are free to be chosen.
Adm Mohammad +5 more
doaj +1 more source
Essential sign change numbers of full sign pattern matrices
Special Matrices, 2016 A sign pattern (matrix) is a matrix whose entries are from the set {+, −, 0} and a sign vector is a vector whose entries are from the set {+, −, 0}. A sign pattern or sign vector is full if it does not contain any zero entries. The minimum rank of a sign
Chen Xiaofeng +7 more
doaj +1 more source
A minimum violations ranking method [PDF]
Optimization and Engineering, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pedings, Kathryn E. +2 more
openaire +2 more sources
Graphs with large rank numbers and rank numbers of subdivided stars
AKCE International Journal of Graphs and Combinatorics, 2020 A -ranking of a graph is a function such that if then every path contains a vertex such that . The rank number of , denoted , is the minimum such that a -ranking exists for .
Hayley Boynton +3 more
doaj +1 more source
Minimum Distance Tests and Estimates Based on Ranks
Revstat Statistical Journal, 2020 It is well known that the least squares estimate in classical linear regression model is very sensitive to violation of the assumptions, in particular normality of model errors.
Radim Navrátil
doaj +1 more source