Edge Transitive Ramanujan Graphs and Highly Symmetric LDPC Good Codes

Details Edge Transitive Ramanujan Graphs and Highly Symmetric LDPC Good Codes Edge Transitive Ramanujan Graphs and Highly Symmetric LDPC Good Codes

2011-08-15

arxiv.org/abs/1108.2960v1

Computer Science

Information Theory

Scientific paper

We present a symmetric LDPC code with constant rate and constant distance
(i.e. good LDPC code) that its constraint space is generated by the orbit of
one constant weight constraint under a group action. Our construction provides
the first symmetric LDPC good codes. This solves the main open problem raised
by Kaufman and Wigderson in [4].

Affiliated with

Also associated with

No associations

Rating

Edge Transitive Ramanujan Graphs and Highly Symmetric LDPC Good Codes 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 Edge Transitive Ramanujan Graphs and Highly Symmetric LDPC Good Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Edge Transitive Ramanujan Graphs and Highly Symmetric LDPC Good Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-301527