Algorithms for Enumerating Balanced Tanner Graphs

Details Algorithms for Enumerating Balanced Tanner Graphs Algorithms for Enumerating Balanced Tanner Graphs

2011-09-23

arxiv.org/abs/1109.5120v1

Computer Science

Information Theory

6 pages

Scientific paper

This summarizes our latest understanding and results about the algorithms for enumerating Tanner Graphs that have a regular structure called Balanced Tanner Graphs. Enumeration algorithms for Balanced Tanner Graphs based upon Cyclic Permutation Groups have been developed in this paper. A constrained enumeration algorithm that enumerates Balanced Tanner Graphs that have a relatively larger length of minimum cycle has been described.

Affiliated with

Also associated with

No associations

Rating

Algorithms for Enumerating Balanced Tanner Graphs 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 Algorithms for Enumerating Balanced Tanner Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algorithms for Enumerating Balanced Tanner Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-724338