Combining linear programming approach with the Plotkin-Johnson argument for constant weight codes, we derive upper bounds on the size of codes of length n and minimum distance d = (n j)=2, 0 < j < n 1=3 . For j = o(n 1=3 ) these bounds practically coincide (are slightly better) with the Tietav ainen bound. For xed j and j proportional to n 1=3 , j < n 1=3 (2=9) lnn, it improves on the earlier...

We currently know the following four bounds on rate as a function of relative distance, three of them upper bounds (which tell us what rate-distance combinations are impossible), and one lower bound (which tells us what rate-distance combinations we can achieve). In the following, R is the rate and δ the relative distance of a code. For example, a (n, k, d) code has R = k/n and δ = d/n. Hq(x) i...

The 22q13.3 deletion syndrome, also known as Phelan-McDermid syndrome, is a contiguous gene disorder resulting from deletion of the distal long arm of chromosome 22. In addition to normal growth and a constellation of minor dysmorphic features, this syndrome is characterized by neurological deficits which include global developmental delay, moderate to severe intellectual impairment, absent or ...

This letter investigates hybrid lower bounds on the mean square error in order to predict the so-called threshold effect. A new family of tighter hybrid large error bounds based on linear transformations (discrete or integral) of a mixture of the McAulay-Seidman bound and the Weiss-Weinstein bound is provided in multivariate parameters case with multiple test points. For use in applications, we...

shwaehman syndrome, next to cystic fibrosis, is the second cause of congenita! exocrine pancreatic insufficiency in children. it appears as steatorrhea, recurrent infections and hematologic abnormalities such as neutropenia, skeletal dysplasia and short stature. in this study, we reviewed 3 patients' histories. all of them showed cellular chemotaxic defect. one of them had been affected by neph...

In this paper, by using the exponential convexity property of a barrier function, we propose an infeasible interior-point method for Cartesian P_*(k) horizontal linear complementarity problem over symmetric cones. The method uses Nesterov and Todd full steps, and we prove that the proposed algorithm is well define. The iteration bound coincides with the currently best iteration bound for the Ca...