On noncatastrophic binary (d, k) trellis codes with large free distances
Ling-Tyan Lyu, Mao‐Chao Lin · 2002
We construct a class of noncatastrophic binary (d, k) trellis codes with large free distances/sup 1/, using the structure of a class of (d, k) trellis codes proposed by Lee and Wolf in 1989. However in our design, two disjoint Steiner triple systems are used as frames to select two disjoint subsets from a maximal concatenatable (d, k) block code.>