STRUCTURED VERSUS MINIMAL TRELLISES COMPLEXITY COMPARISON FOR SOME BEST [n,k,d] CODES

Jozef Obona - Tomáš Holý - Peter Farkaš

   This paper presents new linear binary block codes with codeword length $n$, number of information symbols in codewords k and code distance d_m, which reach the upper or lower bounds on maximal code-distance. They were found using the Kasahara etal construction. This method supports constructions of structured trellises, which has practical importance for wireless communications and software defined radio (SDR). The knowledge of the structured trellis can simplify decoding of the corresponding code using different soft (turbo) algorithms. In this way the set of useful codes for practical applications is broadened to some 'best' codes that would otherwise be difficult to decode using soft algorithms.

Keywords: linear block codes, Hamming distance, Kasahara construction, minimal trellis, structured trellis, turbo-decoding

[full-paper]