Useful groups for trellis codes
J.P. Sarvis, M.D. Trott · 2002
We show how to construct and classify inequivalent homogeneous rate-k/k+1 trellis codes using principles of computational group theory. Given a complete classification of useful trellis structures, trellis codes based on groups are no more difficult to construct than trellis codes based on binary fields.