TCOM
2010
13 years 6 months ago
2010
In this paper, we construct nonbinary quasi-cyclic low-density parity-check (QC-LDPC) codes whose parity check matrices consist of an array of square sub-matrices which are either ...
COMBINATORICS
1998
13 years 11 months ago
1998
The aim of this paper is to give a coherent account of the problem of constructing cubic graphs with large girth. There is a well-defined integer µ0(g), the smallest number of v...
DM
2000
13 years 11 months ago
2000
Erdos proved that there are graphs with arbitrarily large girth and chromatic number. We study the extension of this for generalized chromatic numbers. Generalized graph coloring d...