2011/09/23 by Vivek S Nittoor, Nittoor, Vivek S, Reiji Suda +1
Computer Science · Mathematics · #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1109.5120
6 pages - results in this paper have been superceded by new results
arxiv created 2012/12/31 · arxiv updated 2013/01/01
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.