Typical performance of low-density parity-check codes over general symmetric channels

Details Typical performance of low-density parity-check codes over general symmetric channels Typical performance of low-density parity-check codes over general symmetric channels

2002-04-25

arxiv.org/abs/cond-mat/0204554v2

Physics

Condensed Matter

Disordered Systems and Neural Networks

10 pages, 4 figures, RevTeX4; an error in reference corrected

Scientific paper

10.1088/0305-4470/36/43/033

Typical performance of low-density parity-check (LDPC) codes over a general binary-input output-symmetric memoryless channel is investigated using methods of statistical mechanics. Theoretical framework for dealing with general symmetric channels is provided, based on which Gallager and MacKay-Neal codes are studied as examples of LDPC codes. It has been shown that the basic properties of these codes known for particular channels, including the property to potentially saturate Shannon's limit, hold for general symmetric channels. The binary-input additive-white-Gaussian-noise channel and the binary-input Laplace channel are considered as specific channel noise models.

Affiliated with

Also associated with

No associations

Rating

Typical performance of low-density parity-check codes over general symmetric channels does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Typical performance of low-density parity-check codes over general symmetric channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Typical performance of low-density parity-check codes over general symmetric channels will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-98556