A random coding bound for rate k/n fixed convolutional codes

摘要

In order to guarantee pairwise independence of codeworks in anensemble of convolutional codes it is necessary to considertime-varying codes. However, Seguin hasn shown1 that the pairwiseindependence property is not strictly necessary when applying therandom coding argument and on this basis he derives a new randomcoding bound for rate 1/n fixed convo- lutional codes2. In thispaper we show that a similar random coding bound can be obtained forrate k/n fixed convolutional codes.