Building short turbo codes with high minimum distance using 4-state tail-biting trellises
Emmanuel Cadic, Jean-Claude Carlach · 2003
We present a few short linear f and f- rate block codes viewed as parallel concatenated turbo codes with component codes having 4-state tail-biting trellises. We show how to build the tail-biting trellises with a toolbox of a few 4-state basic sections obtained from the (8,4,4) extended Hamming code. For exam- ple we present the Golay code (24,12,8) in turbo code form.