Results 41 to 50 of about 3,023,466 (332)
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
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
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
Pediatric Blood &Cancer, EarlyView.ABSTRACT Surveillance imaging aims to detect tumour relapse before symptoms develop, but it's unclear whether earlier detection of relapse leads to better outcomes in children and young people (CYP) with medulloblastoma and ependymoma. This systematic review aims to identify relevant literature to determine the efficacy of surveillance magnetic ...
Lucy Shepherd +3 more
wiley +1 more source
Identification in Parametric Models: The Minimum Hellinger Distance Criterion
Econometrics, 2022 This note studies the criterion for identifiability in parametric models based on the minimization of the Hellinger distance and exhibits its relationship to the identifiability criterion based on the Fisher matrix.
David Pacini
doaj +1 more source
Miscorrection probability beyond the minimum distance [PDF]
, 2004 The miscorrection probability of a list decoder is the probability that the decoder will have at least one non-causal codeword in its decoding sphere. Evaluating this probability is important when using a list-decoder as a conventional decoder since in ...
Bruck, Jehoshua, Cassuto, Yuval
core
On the minimum distance of elliptic curve codes
, 2015 Computing the minimum distance of a linear code is one of the fundamental problems in algorithmic coding theory. Vardy [14] showed that it is an \np-hard problem for general linear codes.
Li, Jiyou, Wan, Daqing, Zhang, Jun
core +1 more source
On the Minimum/Stopping Distance of Array Low-Density Parity-Check Codes [PDF]
, 2014 In this work, we study the minimum/stopping distance of array low-density parity-check (LDPC) codes. An array LDPC code is a quasi-cyclic LDPC code specified by two integers q and m, where q is an odd prime and m
Ambroze, Marcel A. +2 more
core +3 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT Introduction Neuroblastoma (NB) with central nervous system (CNS) metastases is rare at diagnosis, but occurs more often during relapse/progression. Patients with CNS metastases face a dismal prognosis, with no standardized curative treatment available.
Vicente Santa‐Maria Lopez +13 more
wiley +1 more source
Codes with Locality for Two Erasures
, 2014 In this paper, we study codes with locality that can recover from two erasures via a sequence of two local, parity-check computations. By a local parity-check computation, we mean recovery via a single parity-check equation associated to small Hamming ...
Kumar, P. Vijay +2 more
core +1 more source