Papers
Topics
Authors
Recent
Search
2000 character limit reached

A Mathematical Approach to Balanced Tanner Graph Enumeration

Published 23 Sep 2011 in cs.IT, math.CO, and math.IT | (1109.5083v2)

Abstract: This paper summarizes our latest understanding and results about the application of the Mathematics Of Enumeration to Tanner Graphs that have a regular structure called Balanced Tanner Graphs. Some preliminaries of permutation groups have been presented followed by various enumeration theorems, and finally our approach for enumeration of Balanced Tanner Graphs has been explained, and several open questions have been raised.

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