### Table 1. Generating matrices for the constituent convolutional codes.

1997

"... In PAGE 4: ... Consider a rate 1/4 HCCC formed by a parallel four-state recursive systematic convo- lutional code with rate 1/2, where the systematic bits of the parallel encoder (as for turbo codes) are not transmitted; an outer four-state nonrecursive convolutional code with rate 1/2; and an inner four- state recursive systematic convolutional code with rate 2/3, joined by two uniform interleavers of length N1 = N and N2 =2N, where N=20, 40, 100, 200, and 300. The code generator matrices are shown in Table1 . Using Expression (4), we have obtained the bit- error probability curves shown in Fig.... ..."

Cited by 7

### Table 7. Configuration details, different outer codes with MSK. S is the number of states and D is the decoder delay.

"... In PAGE 49: ...ystem in section 3.5.1. See Table7 for details. All codes are non-recursive, non-systematic convolutional codes.... ..."

### Table IV reports values of fi and fl for various memory values and rates for a rate 1=2 punctured recursive systematic convolutional encoder with memory ranging from 2 bits to 4 bits. The considered puncturing sequence is periodic: the systematic bits are never punctured, while the coded bits are punctured according to the following sequence:

2006

Cited by 1

### Table 9. Polynomials of rate 5/6 recursive systematic codes.

2003

"... In PAGE 94: ... For the recursive outer codes, we performed a random search to find good codes with maximum free Hamming distance. The results of the random search are shown on the following two tables: Table9 and Table 10. T T d6 d5 d4 d2 d3 d1 Parity Figure 19.... ..."

### Table 1: Systematic unit-memory quaternary convolutional codes from linear block codes over GR(4, 2)

2006

"... In PAGE 7: ...2]). 5 Examples In Table1 , for fixed rates, we give known systematic linear block codes over GR(4, 2) (please see [1, 3]) and their minimum Hamming distances d. The encoder G(D) for the associated convolutional code C(B, h, G) has unit memory.... ..."

### TABLE II THE BEST = 3 QPSK RECURSIVE SYSTEMATIC CONSTITUENT CODES FOR 2 BPS/HZ STTUCM FROM OPTIMIZATION OVER FAST FADING CHANNELS.

2003

Cited by 1

### Table 1: CPU time comparisons for full convolution versus recursive convolution methods. Times are in seconds on a SUN IPX.

"... In PAGE 20: ... As can be seen from the gure, the iFFT-derived response is equally accurate as expected since a fairly large number of frequency points were used. In Table1 we show the CPU times required for obtaining the three time responses shown. The total number of timesteps required for obtaining the solution in the interval shown was 1004.... ..."

### TABLE I THE BEST = 3 QPSK RECURSIVE SYSTEMATIC CONSTITUENT CODES FOR 2 BPS/HZ STTUCM FROM OPTIMIZATION OVER QUASI-STATIC FADING CHANNELS.

2003

Cited by 1

### Table 4.1. The best = 3 QPSK recursive systematic constituent codes for 2 bps/Hz STTuCM over quasi-static fading channels.

2003

### Table 1: convolutional codes used in the analysis.

"... In PAGE 10: ... The numerical results presented in the next section is obtained based on the assumption of accurate power control and perfect statistical multi- plexing, which demonstrate the benchmarking performance of the integrated error control and power control strategy. 4 Numerical Results and Discussion Table1 lists the convolutional codes under consideration. The codes have the maximum free distance for the corresponding constraint length and code rate #5B14#5D-#5B15#5D.... ..."

Cited by 1