The trellis structure of linear codes over Galois rings
Qinqin Yang, Zhongping Qin · 2007
In the paper, we analyze the minimal trellis structure for linear codes over Galois rings, which can be applied to achieve faster trellis-based decoding algorithms. We point out that the structure of minimal trellis for C is determined solely by the conventional spans of a biproper Fq-basis, which are uniquely determined by C.