Some construction methods for error-correcting (d,k) codes

Considers three methods for constructing (d,k) codes with guaranteed error-correcting capability. All three methods begin with state-dependent modulation codes to satisfy the (d,k) constraints. The first is an ad hoc method that uses the state-splitting procedure of Adler et al. (1983), together with additional constraints to ensure that the required minimum distance is achieved. The second method partitions the state-dependent modulation code into a part with memory and a part without, and then combines the part with memory with a matched convolutional code to provide error protection. The third method is obtained by modifying of the procedure of Lee and Wolf (1989) to accommodate state-dependent modulation codes. All three methods have yielded codes whose rates, computational complexities, and error-correcting capabilities compare favorably with codes designed using other methods.<
>