Further Results on Convolutional Code Search for Block-Fading Channels

This correspondence presents results of code search for convolutional codes over block-fading channels (BFCs). Search criteria are based on a union bound approach which exploits the concept of generalized transfer function (GTF) of the error trellis diagram. A new asymptotic bound is derived, and the performance of the codes found using our search criterion is compared analytically and by numerical simulation with already existing codes.