BACKGROUND A number of data sets show that high parity births are associated with higher child mortality than low parity births. The reasons for this relationship are not clear. In this paper we investigate whether high parity is associated with lower coverage of key health interventions that might lead to increased mortality. METHODS We used DHS data from 10 high fertility countries to exami...

The low density parity check codes whose performance is closest to the Shan-non limit arèGallager codes' based on irregular graphs. We compare alternative methods for constructing these graphs and present two results. First, we nd a `super{Poisson' construction which gives a small improvement in empirical performance over a random construction. Second, whereas Gallager codes normally take N 2 t...

Abstract. As a generalization of cyclic codes of length p over Fpa , we study n-dimensional cyclic codes of length p1 ×· · ·×pn over Fpa generated by a single “monomial”. Namely, we study multi-variable cyclic codes of the form 〈(x1 − 1) i1 · · · (xn − 1) n〉 ⊂ Fq [x1,...,xn] 〈x ps1 1 −1,...,x psn n −1〉 . We call such codes monomial-like codes. We show that these codes arise from the product of ...

Let C be a Z2Z4-additive code of length n > 3. We prove that if the binary Gray image of C, C = Φ(C), is a 1-perfect nonlinear code, then C cannot be a Z2Z4-cyclic code except for one case of length n = 15. Moreover, we give a parity check matrix for this cyclic code. Adding an even parity check coordinate to a Z2Z4-additive 1-perfect code gives an extended 1-perfect code. We also prove that an...

We investigate algebraic constructions for a class of iteratively encodable low-density parity-check codes suitable for high rate applications. The iterative encoding technique, which is based upon the graphical representation of the code, allows the decoder circuit to be also used for encoding, thus saving circuit area. A method for constructing a (3,6)-regular class of such codes is already k...

This paper presents a new class of q-ary erasure-correcting codes based on Latin and Sudoku squares of order q, and an iterative decoding algorithm similar to the one used for the Low Density Parity Check code. The algorithm works by assigning binary variables to the q-ary values, and by generalizing the definition of parity check operation to represent the constraints that define the Latin and...

Ordered binary decision diagrams (OBDDs) have already proved useful for example in the veriication of combinational and sequential circuits. But the applications are limited, since the decriptive power of OBDDs is limited. Therefore several more general BDD models are studied. In this paper the so{called Parity{OBDDs are considered. The two polynomial time algorithms given are motivated by the ...

Results are reported for the first calculation of the low-lying spin-1/2 odd-parity octet baryon masses using O(a) improved gluon and fermion actions. Methods for removing even-parity ground-state contaminations from the two-point correlation functions at zero and finite momenta are outlined. We investigate the properties of two odd-parity interpolating fields based on the established interpola...

We study the query complexity of WEAK PARITY: the problem of computing the parity of an n-bit input string, where one only has to succeed on a 1/2+ε fraction of input strings, but must do so with high probability on those inputs where one does succeed. It is well-known that n randomized queries and n/2 quantum queries are needed to compute parity on all inputs. But surprisingly, we give a rando...

In a recent paper (arXive:hep-ph/0406125) entitled Parity violation in hot QCD: why it can happen, and how to look for it, D. Kharzeev argues for the possibility of Pand/or CPviolation effects in heavy-ion collisions, the effects that can manifest themselves via asymmetry in π production with respect to the direction of the system angular momentum. Here we present an experimental observable tha...