Minimum distance bounding techniques for individual trellis codes
J.-E. Porath · IEEE Transactions on Communications · 1995
Lower- and upper distance bounds are developed for arbitrary individual trellis codes. The bounds are evaluated with help of error state trellises. The computational complexity is significantly reduced since pair states are avoided. The bounds may be applied to non-regular codes.>