Results 31 to 40 of about 641,465 (260)
On the minimum distance of Castle codes
Finite Fields and Their Applications, 2013 Abstract Castle codes are algebraic geometry one-point codes on Castle curves. This family contains some of the most important AG codes among those studied in the literature to date. The minimum distance of these codes can be bounded by using the order-like bound d ⁎ , which is known to be equivalent to the classical order bound when both
Wilson Olaya-León, Carlos Munuera
openaire +1 more source
Unsupervised Ensemble Hashing: Boosting Minimum Hamming Distance
IEEE Access, 2020 Hashing aims at learning discriminative binary codes of high-dimensional data for the approximate nearest neighbor searching. However, the distance ranking obtained by traditional methods is not optimum in the Hamming space, and it degrades the ...
Yufei Zha +3 more
doaj +1 more source
On Minimum Generalized Degree Distance Index of Cyclic Graphs
International Journal of Mathematics and Mathematical Sciences, 2023 Topological index (TI) is a mapping that associates a real number to the under study (molecular) graph which predicts its various physical and chemical properties.
Nadia Khan +3 more
doaj +1 more source
The Annals of Mathematical Statistics, 1957 The present paper gives the formal statements and proofs of the results illustrated in [1]. In a series of papers ([2], [3], [4]) the present author has been developing the minimum distance method for obtaining strongly consistent estimators (i.e., estimators which converge with probability one).
openaire +3 more sources
On the minimum distance of cyclic codes
IEEE Transactions on Information Theory, 1986 A new lower bound for the minimum distance of cyclic codes is given that includes the earlier BCH, Hartmann-Tzeng and Roos bounds. For n-vectors \b{a} and ḇ let \b{a}\({}^*\underline b\) be the Hadamard product. For an \(m\times n\) matrix \b{A} and \(k\times n\) matrix Ḇ, \b{A}\({}^*\underline B\) is the matrix that has as rows all the products \b{a}\(
van Lint, J.H., Wilson, R.M.
openaire +2 more sources
Reversible Self-Dual Codes over Finite Field
Cauchy: Jurnal Matematika Murni dan AplikasiReversible self-dual code is a linear code which combine the properties from self-dual code and reversible code. Previous research shows that reversible self-dual codes have only been developed over field of order 2 and order 4.
Ardi Nur Hidayat +2 more
doaj +1 more source
Projective parameterized linear codes
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2015 In this paper we estimate the main parameters of some evaluation codes which are known as projective parameterized codes. We find the length of these codes and we give a formula for the dimension in terms of the Hilbert function associated to two ideals,
González Sarabia Manuel +2 more
doaj +1 more source
Minimum Average Distance Triangulations [PDF]
, 2012 We study the problem of finding a triangulation T of a planar point set S such as to minimize the expected distance between two points x and y chosen uniformly at random from S. By distance we mean the length of the shortest path between x and y along edges of T. The length of a path is the sum of the weights of its edges.
openaire +2 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT Pediatric gastroenteropancreatic neuroendocrine neoplasms (GEP‐NENs) are extremely rare and clinically heterogeneous. Management has largely been extrapolated from adult practice. This European Standard Clinical Practice Guideline (ESCP), developed by the EXPeRT network in collaboration with adult NEN experts, provides (adult) evidence ...
Michaela Kuhlen +23 more
wiley +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