### Table 3: Cutting plane for low density graphs

2002

Cited by 5

### TABLE II PERFORMANCE IN SYNCHRONOUS MODE circuit min %regular-density %low-density %low-density

1994

Cited by 42

### TABLE III PERFORMANCE IN ASYNCHRONOUS MODE circuit min % regular-density % low-density %low-density

1994

Cited by 42

### TABLE II PERFORMANCE IN SYNCHRONOUS MODE circuit min %regular-density %low-density %low-density

1998

Cited by 2

### TABLE III PERFORMANCE IN ASYNCHRONOUS MODE circuit min % regular-density % low-density %low-density

1998

Cited by 2

### Table 2: Result in the low density case with 0.6 s headway

"... In PAGE 5: ...nds. As we can see, our experimental result of 0.6 is realistic3. Table2 sums up the results of a second simulation with low density. In this simulation, the time headway was 0.... ..."

### Table 1: Result in the low density case with 1 s headway

"... In PAGE 5: ... The low density case study takes about three hours to run to completion. Table1 sums up the results of the low density simulation. In this simulation, the time headway was 1 second.... In PAGE 5: ...6 second. The table shows that the tra c is smoother than in the 1 second case (see Table1 ). For instance, after 30 minutes, the average distance after merging at the third junction is 145.... ..."

### Table 1 Parameters of some low-density generator matrix codes.

1996

"... In PAGE 6: ... This might be because of the smaller sizes of girths in the bipartite graphs [15,16,19,20] with this high connection parameters. More high-rate codes with the parameters listed in Table1 have been constructed and studied. The performance curves of the codes with K = 1024 after 16 iterations of decoding are shown in Fig.... In PAGE 7: ... 6 the channel capacities of memoryless AWGN channels with equiprobable signaling of BPSK, QPSK, and 8PSK given by [27] C = log2 M ? 1 M M X i=1 E quot; log2 M X j=1 exp jsi + n ? sjj2 ? jnj2 N0 !# ; where M is the size of the signaling alphabet, si is a signaling symbol with E[jsij2] = 1, and n is a Gaussian random variable with zero mean and variance N0=2. The performances of the codes listed in Table1 with K = 16384 after 16 iterations of decoding are marked in Fig. 6 by cross-plus signs and labeled by \BPSK with LDGM Codes.... ..."

Cited by 10

### Table 2: Link statistics for satisfiable, low-density problems.

2006

Cited by 4

### Table 2: Link statistics for satisflable, low-density problems.

2006

Cited by 4