Abstract
Algorithms for conversion from feedforward (FF) to feedback (FB) codes and vice versa are presented. The former is based on a trellis search and the latter on an algebraic solution. The algorithms work on trellis codes of rate R = k/n.

This publication has 0 references indexed in Scilit: