15 search results - page 1 / 3 » The Moore Bound for Irregular Graphs |
GC
2002
Springer
13 years 7 months ago
2002
Springer
CORR
2004
Springer
13 years 7 months ago
2004
Springer
We present two sequences of ensembles of non-systematic irregular repeat-accumulate codes which asymptotically (as their block length tends to infinity) achieve capacity on the bi...
STOC
1998
ACM
13 years 11 months ago
1998
ACM
In [6], Gallager introduces a family of codes based on sparse bipartite graphs, which he calls low-density parity-check codes. He suggests a natural decoding algorithm for these c...
JGT
2008
13 years 7 months ago
2008
Let G be a simple graph of order n with no isolated vertices and no isolated edges. For a positive integer w, an assignment f on G is a function f : E(G) {1, 2, . . . , w}. For a ...
STOC
2006
ACM
14 years 1 months ago
2006
ACM
It has been known for some time that graph isomorphism reduces to the hidden subgroup problem (HSP). What is more, most exponential speedups in quantum computation are obtained by...