Searching for tailbiting codes with large minimum distances
Irina E. Bocharova, Boris D. Kudryashov, Rolf Johannesson, P. Ståhl · 2002
Tailbiting trellis representations of linear block codes with an arbitrary sectionalization of the time axis are studied. A new lower bound on the maximal state complexity of an arbitrary tailbiting code is derived. The asymptotic behavior of the derived bound is investigated. Some new tailbiting representations for linear block codes of rates R=1/c, c=2,3,4 are presented.