Trellis decoding of some decomposable codes

This paper presents a maximum likelihood (ML) soft decision decoding scheme to implement Viterbi Algorithm for some constructed decomposable codes of Hamming distance four and show that the decoding complexity is simple, hence, it may be employed in trellis - based decoders. Bit error rate performances of some decomposable codes that were obtained employing the technique in AWGN channel are also presented.