Partitioning algorithms for soft decision decoding of block codes

Using some little-known but very important results (Evseev's (1983) performance bound and the partitioned decoding technique), new algorithms have been devised, providing useful new performance results and complexity evaluations for practical soft-decision decoders. In addition, a deeper and clearer understanding of the problems and possibilities of this topic has emerged.<<ETX>>