Low Parity Density Check Codes

Guys,
In information theory, a low density parity check codes is a linear error correcting code, a method of transmitting a message over a noisy transmission channel. 
The name comes from the characteristic of their parity-check matrix which contains only a few 1’s in comparison to the amount of 0’s.
Their main advantage is that they provide a performance which is very close to the capacity for a lot of different channels and linear time complex algorithms for decoding. Furthermore are they suited for implementations that make heavy use of parallelism.


if you need my presentation that I made click [You must be registered and logged in to see this link.]