Algorithms for Enumerating Balanced Tanner Graphs
Information Theory
2013-01-01 v2 math.IT
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.
Keywords
Cite
@article{arxiv.1109.5120,
title = {Algorithms for Enumerating Balanced Tanner Graphs},
author = {Vivek S Nittoor and Reiji Suda},
journal= {arXiv preprint arXiv:1109.5120},
year = {2013}
}
Comments
6 pages - results in this paper have been superceded by new results