Date Added: Jan 2010
The performance of CNECCs under the BSC edge error model has been analyzed using theoretical bounds and simulations. A sufficient upper bound on the edge cross-over probability pe has been obtained, so that if pe is below this bound, the complexity of analysis can be reduced greatly by considering only single edge network-errors. Codes with better distance spectra and those with good slopes are seen to perform well under different conditions on the cross-over probability. A lower bound on the slope of any convolutional code is also obtained.