A Mathematical Approach to Balanced Tanner Graph Enumeration

2011/09/23 by Vivek S. Nittoor, Vivek S Nittoor, Nittoor, Vivek S +2
Computer Science · Mathematics · #Advanced Combinatorial Mathematics #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Computer and information sciences #FOS: Mathematics #Graph theory and applications #Information Theory (cs.IT) #cs.IT #math.CO #math.IT

paper · pdf · doi:10.48550/arxiv.1109.5083

8 pages - results in this paper have been superceded by new results

openalex publication_date 2011/09/23 · arxiv created 2012/12/31 · arxiv updated 2013/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related

• Algorithms for Enumerating Balanced Tanner Graphs
• A new counting methods, including the issue of counting labelled self-complementary graphs
• Enumeration of balanced finite group valued functions on directed graphs
• Graphical Compositions 1: Basic Enumeration
• Reduced decompositions and commutation classes