1,309 research outputs found
Some identities for enumerators of circulant graphs
We establish analytically several new identities connecting enumerators of
different types of circulant graphs of prime, twice prime and prime-squared
orders. In particular, it is shown that the semi-sum of the number of
undirected circulants and the number of undirected self-complementary
circulants of prime order is equal to the number of directed self-complementary
circulants of the same order.
Keywords: circulant graph; cycle index; cyclic group; nearly doubled primes;
Cunningham chain; self-complementary graph; tournament; mixed graphComment: 17 pages, 3 tables Categories: CO Combinatorics (NT Number Theory)
Math Subject Class: 05C30; 05A19; 11A4
Quasi-Cyclic Asymptotically Regular LDPC Codes
Families of "asymptotically regular" LDPC block code ensembles can be formed
by terminating (J,K)-regular protograph-based LDPC convolutional codes. By
varying the termination length, we obtain a large selection of LDPC block code
ensembles with varying code rates, minimum distance that grows linearly with
block length, and capacity approaching iterative decoding thresholds, despite
the fact that the terminated ensembles are almost regular. In this paper, we
investigate the properties of the quasi-cyclic (QC) members of such an
ensemble. We show that an upper bound on the minimum Hamming distance of
members of the QC sub-ensemble can be improved by careful choice of the
component protographs used in the code construction. Further, we show that the
upper bound on the minimum distance can be improved by using arrays of
circulants in a graph cover of the protograph.Comment: To be presented at the 2010 IEEE Information Theory Workshop, Dublin,
Irelan
- …