Papers
Topics
Authors
Recent
Search
2000 character limit reached

Algorithms for Enumerating Balanced Tanner Graphs

Published 23 Sep 2011 in cs.IT and math.IT | (1109.5120v2)

Abstract: 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.

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (2)

  1. Vivek S Nittoor 
  2. Reiji Suda 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up