Weaknesses of Margulis and Ramanujan-Margulis low-density parity-check codes

We report weaknesses in two algebraic constructions of low-density parity-check codes based on expander graphs. The Margulis construction gives a code with near-codewords, which cause problems for the sum-product decoder; The Ramanujan-Margulis construction gives a code with low-weight codewords, which produce an error-floor. © 2004 Elsevier B.V.

Performance of low density parity check codes as a function of actual and assumed noise levels

We investigate how sensitive Gallager's codes are, when decoded by the sum-product algorithm, to the assumed noise level. We have found a remarkably simple function that fits the empirical results as a function of the actual noise level at both high and low noise levels. © 2004 Elsevier B.V.

Performance of low density parity check codes as a function of actual and assumed noise levels

We investigate how sensitive Gallager's codes are, when decoded by the sum-product algorithm, to the assumed noise level. We have found a remarkably simple function that fits the empirical results as a function of the actual noise level at both high and low noise levels. ©2003 Published by Elsevier Science B. V.

Weaknesses of margulis and ramanujan-margulis low-density parity-check codes

We report weaknesses in two algebraic constructions of low-density parity-check codes based on expander graphs. The Margulis construction gives a code with near-codewords, which cause problems for the sum-product decoder; The Ramanujan-Margulis construction gives a code with low-weight codewords, which produce an error-floor. ©2003 Published by Elsevier Science B. V.

Enhanced performance of an all-optical parity checker using a single Mach-Zehnder interferometer

An all-optical parity checker is proposed that requires only a single Mach-Zehnder interferometer. Simulation results demonstrate an 8dB improvement in extinction ratio at 10 Gb/s operation. © 1999 Optical Society of America.

Comparison of constructions of irregular Gallager codes

The low-density parity check codes whose performance is closest to the Shannon limit are `Gallager codes' based on irregular graphs. We compare alternative methods for constructing these graphs and present two results. First, we find a `super-Poisson' construction which gives a small improvement in empirical performance over a random construction. Second, whereas Gallager codes normally take N2 time to encode, we investigate constructions of regular and irregular Gallager codes that allow more rapid encoding and have smaller memory requirements in the encoder. We find that these `fast encoding' Gallager codes have equally good performance.

Application of neural networks to the ranking of perinatal variables influencing birthweight.

In this paper we compare Multi-Layer Perceptrons (a neural network type) with Multivariate Linear Regression in predicting birthweight from nine perinatal variables which are thought to be related. Results show, that seven of the nine variables, i.e., gestational age, mother's body-mass index (BMI), sex of the baby, mother's height, smoking, parity and gravidity, are related to birthweight. We found no significant relationship between birthweight and each of the two variables, i.e., maternal age and social class.