Iterative probabilistic decoding and parity checks with memory

A method that effectively reduces the weight of parity checks used in iterative probabilistic decoding algorithms is proposed. The method is especially applicable to so-called parity checks with memory and may lead to a significant improvement in fast correlation attacks on stream ciphers based on linear feedback shift registers. A technique for generating low-weight parity checks with memory is also proposed.