Min-Sum algorithm for lattices constructed by Construction D

Details Min-Sum algorithm for lattices constructed by Construction D Min-Sum algorithm for lattices constructed by Construction D

2012-01-19

arxiv.org/abs/1201.3982v1

Computer Science

Cryptography and Security

10 pages, 1 figure

Scientific paper

The so-called min-sum algorithm has been applied for decoding lattices constructed by Construction D'. We generalize this iterative decoding algorithm to decode lattices constructed by Construction D. An upper bound on the decoding complexity per iteration, in terms of coding gain, label group sizes of the lattice and other factors is derived. We show that iterative decoding of LDGM lattices has a reasonably low complexity such that lattices with dimensions of a few thousands can be easily decoded.

Affiliated with

Also associated with

No associations

Rating

Min-Sum algorithm for lattices constructed by Construction D 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 Min-Sum algorithm for lattices constructed by Construction D, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Min-Sum algorithm for lattices constructed by Construction D will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-253700