BIFAST-an algorithm for computing distance spectrum of trellis codes

V. Šenk, D.E. Lazic, Miroslav Despotović · 2002

Two efficient algorithms for evaluating the distance spectrum of trellis codes were recently published. The authors have constructed an efficient algorithm for computing the distance spectrum by combining the best features of the two. A comparison is made of the computational effort that these algorithms must make in order to produce the distance spectrum for a given distance.>

Read the paper · More papers on PaperTik